Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
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)
Pseudorandom generators without the XOR Lemma (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
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
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Superpolynomial Circuits, Almost Sparse Oracles and the Exponential Hierarchy
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
Randomness vs. Time: De-Randomization under a Uniform Assumption
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Derandomizing Arthur-Merlin Games Using Hitting Sets
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Comparing Notions of Full Derandomization
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
How to Go Beyond the Black-Box Simulation Barrier
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
Computational Complexity
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
On the randomness complexity of efficient sampling
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Derandomizing Arthur-Merlin games using hitting sets
Computational Complexity
Circuit lower bounds for Merlin-Arthur classes
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Upward separations and weaker hypotheses in resource-bounded measure
Theoretical Computer Science
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
Hardness-randomness tradeoffs for bounded depth arithmetic circuits
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Limitations of Hardness vs. Randomness under Uniform Reductions
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Algebrization: A New Barrier in Complexity Theory
ACM Transactions on Computation Theory (TOCT)
A zero-one law for RP and derandomization of AM if NP is not small
Information and Computation
Unconditional Lower Bounds against Advice
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Pseudorandom Generators and Typically-Correct Derandomization
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Improving exhaustive search implies superpolynomial lower bounds
Proceedings of the forty-second ACM symposium on Theory of computing
Typically-correct derandomization
ACM SIGACT News
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
Arithmetic Circuits: A survey of recent results and open questions
Foundations and Trends® in Theoretical Computer Science
Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits
SIAM Journal on Computing
S-T connectivity on digraphs with a known stationary distribution
ACM Transactions on Algorithms (TALG)
Nexp does not have non-uniform quasipolynomial-size ACC circuits of o(log log n) depth
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Robust simulations and significant separations
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Studies in complexity and cryptography
Guest column: a casual tour around a circuit complexity bound
ACM SIGACT News
Some results on average-case hardness within the polynomial hierarchy
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and 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
Massive online teaching to bounded learners
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Natural proofs versus derandomization
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Nonuniform ACC Circuit Lower Bounds
Journal of the ACM (JACM)
Pseudorandom generators for combinatorial checkerboards
Computational Complexity
| Hi-index | 0.00 |
Restricting the search space {0,1}n to the set of truth tables of "easy" Boolean functions on log n variables, as well as using some known hardness-randomness tradeoffs, we establish a number of results relating the complexity of exponential-time and probabilistic polynomial-time complexity classes. In particular, we show that NEXP⊂P/poly ← NEXP = MA; this can be interpreted as saying that no derandomization of MA (and, hence, of promise-BPP) is possible unless NEXP contains a hard Boolean function. We also prove several downward closure results for ZPP, RP, BPP, and MA; e.g., we show EXP = BPP ← EE = BPE, where EE is the double-exponential time class and BPE is the exponential-time analogue of BPP.