Some consequences of the existence of pseudorandom generators
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Almost-everywhere superiority for Quantum polynomial time
Information and Computation
Weak completeness notions for exponential time
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Hi-index | 0.00 |