Relativized circuit complexity
Journal of Computer and System Sciences
A decisive characterization of BPP
Information and Control
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
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
A new general derandomization method
Journal of the ACM (JACM)
New Collapse Consequences of NP Having Small Circuits
SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Improved Derandomization of BPP Using a Hitting Set Generator
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Weak random sources, hitting sets, and BPP simulations
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Near-Optimal Conversion of Hardness into Pseudo-Randomness
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
One-sided versus two-sided error in probabilistic computation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Super-polynomial versus half-exponential circuit size in the exponential hierarchy
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Guest Column: NP-complete problems and physical reality
ACM SIGACT News
On the complexity of communication complexity
Proceedings of the forty-first annual ACM symposium on Theory of computing
Improving exhaustive search implies superpolynomial lower bounds
Proceedings of the forty-second ACM symposium on Theory of computing
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
The complexity of Boolean formula minimization
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Limits on the computational power of random strings
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Approximability of minimum AND-Circuits
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Limits on the computational power of random strings
Information and Computation
Natural proofs versus derandomization
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
The evolution of representation in simple cognitive networks
Neural Computation
| Hi-index | 0.00 |