Randomness conservation inequalities; information and independence in mathematical theories
Information and Control
Almost everywhere high nonuniform complexity
Journal of Computer and System Sciences
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
The quantitative structure of exponential time
Complexity theory retrospective II
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
The zero-one law holds for BPP
Theoretical Computer Science
In search of an easy witness: exponential time vs. probabilistic polynomial time
Journal of Computer and System Sciences - Complexity 2001
On Resource-Bounded Measure and Pseudorandomness
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
Pseudorandom generators, measure theory, and natural proofs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
SIAM Journal on Computing
Baire categories on small complexity classes and meager--comeager laws
Information and Computation
Martingale families and dimension in P
Theoretical Computer Science
Hardness hypotheses, derandomization, and circuit complexity
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
A zero-one SUBEXP-dimension law for BPP
Information Processing Letters
Hi-index | 0.00 |
We show that if RP does not have p-measure zero then ZPP = EXP. As corollaries we obtain a zero-one law for RP in EXP, and that both probabilistic classes ZPP and RP have the same measure in EXP. We also prove that if NP does not have p-measure zero then NP = AM.