Almost everywhere high nonuniform complexity
Journal of Computer and System Sciences
Measure on P: strength of the notion
Information and Computation
The zero-one law holds for BPP
Theoretical Computer Science
Randomness vs time: derandomization under a uniform assumption
Journal of Computer and System Sciences
Hausdorff Dimension in Exponential Time
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Dimension in Complexity Classes
SIAM Journal on Computing
Martingale families and dimension in P
Theoretical Computer Science
Measure on small complexity classes, with applications for BPP
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
A zero-one law for RP and derandomization of AM if NP is not small
Information and Computation
| Hi-index | 0.89 |
We show that BPP has either SUBEXP-dimension zero (randomness is easy) or BPP=EXP (randomness is intractable).