How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Randomness, provability, and the separation of Monte Carlo time and space
Computation theory and logic
A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Probabilistic computation and linear time
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A note on almost-everywhere-complex sets and separating deterministic-time-complexity classes
Information and Computation
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
Almost-everywhere complexity hierarchies for nondeterministic time
Theoretical Computer Science
Journal of Computer and System Sciences
BPP has subexponential time simulations unless EXPTIME has publishable proofs
Computational Complexity
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Retraction of probabilistic computation and linear time
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Two-Tape Simulation of Multitape Turing Machines
Journal of the ACM (JACM)
Separating Nondeterministic Time Complexity Classes
Journal of the ACM (JACM)
Randomness vs. Time: De-Randomization under a Uniform Assumption
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Extractors and pseudo-random generators with optimal seed length
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
| Hi-index | 0.00 |