How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
Relativized circuit complexity
Journal of Computer and System Sciences
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
Expanders, randomness, or time versus space
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
Bounded round interactive proofs in finite groups
SIAM Journal on Discrete Mathematics
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
Explicit OR-dispersers with polylogarithmic degree
Journal of the ACM (JACM)
A new general derandomization method
Journal of the ACM (JACM)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Construction of extractors using pseudo-random generators (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
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
Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
On Resource-Bounded Measure and Pseudorandomness
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Hard-core distributions for somewhat hard problems
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Weak random sources, hitting sets, and BPP simulations
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Derandomizing Arthur-Merlin Games
Derandomizing Arthur-Merlin Games
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Computational complexity and the classification of finite simple groups
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
One-sided versus two-sided error in probabilistic computation
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On transformation of interactive proofs that preserve the prover's complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Pseudo-random generators for all hardnesses
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
In search of an easy witness: exponential time vs. probabilistic polynomial time
Journal of Computer and System Sciences - Complexity 2001
On Interactive Proofs with a Laconic Prover
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Derandomizing Arthur-Merlin Games under Uniform Assumptions
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Some Results on Derandomization
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
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
Error-Correcting Codes and Pseudorandom Projections
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Pseudo-random generators for all hardnesses
Journal of Computer and System Sciences - STOC 2002
On interactive proofs with a laconic prover
Computational Complexity
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
Computational Complexity
Simple extractors for all min-entropies and a new pseudorandom generator
Journal of the ACM (JACM)
Zero knowledge with efficient provers
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Lower bounds for non-black-box zero knowledge
Journal of Computer and System Sciences - Special issue on FOCS 2003
Derandomizing Arthur-Merlin games using hitting sets
Computational Complexity
Low-end uniform hardness vs. randomness tradeoffs for AM
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Pseudorandomness for Approximate Counting and Sampling
Computational Complexity
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
Proceedings of the twenty-fourth annual symposium on Computational geometry
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Solvable Group Isomorphism Is (Almost) in NP ∩ coNP
ACM Transactions on Computation Theory (TOCT)
Pseudorandomness and derandomization
XRDS: Crossroads, The ACM Magazine for Students - The Legacy of Alan Turing: Pushing the Boundaries of Computation
A note on zero error algorithms having oracle access to one NP query
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Reconstructive dispersers and hitting set generators
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Arthur-Merlin games and the problem of isomorphism testing
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
| Hi-index | 0.00 |
We prove that AM (and hence Graph Nonisomorphism) is in NP if for some \math, some language in \math requires nondeterministic circuits of size \math. This improves recent results of Arvind and Kobler and of Klivans and Van Melkebeek who proved the same conclusion, but under stronger hardness assumptions, namely, either the existence of a language in \math which cannot be approximated by nondeterministic circuits of size less than \math or the existence of a language in \math which requires oracle circuits of size \math with oracle gates for satisfiability.The previous results on derandomizing AM were based on pseudorandom generators. In contrast, our approach is based on a strengthening of Andreev, Clementi and Rolim's hitting set approach to derandomization. As a spin-off, we show that this approach is strong enough to give an easy (if the existence of explicit dispersers can be assumed known) proof of the following implication: For some \math, if there is a language in E which requires nondeterministic circuits of size \math, then P=BPP. This differs from Impagliazzo and Wigderson's theorem "only" by replacing deterministic circuits with nondeterministic ones.