Relativized circuit complexity
Journal of Computer and System Sciences
On relativized exponential and probabilistic complexity classes
Information and Control
Random generation of combinatorial structures from a uniform
Theoretical Computer Science
Private coins versus public coins in interactive proof systems
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
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
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
If NP has polynomial-size circuits, then MA=AM
Theoretical Computer Science
More on BPP and the polynomial-time hierarchy
Information Processing Letters
Oracles and queries that are sufficient for exact learning
Journal of Computer and System Sciences
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
Symmetric alternation captures BPP
Computational Complexity
Uniform generation of NP - witnesses using an NP -oracle
Information and Computation
On Resource-Bounded Measure and Pseudorandomness
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
Recent Directions in Algorithmic Research
Proceedings of the 5th GI-Conference on Theoretical Computer Science
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
A Tight Karp-Lipton Collapse Result in Bounded Arithmetic
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
On the Complexity of Succinct Zero-Sum Games
Computational Complexity
The 1-versus-2 queries problem revisited
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
A tight Karp-Lipton collapse result in bounded arithmetic
ACM Transactions on Computational Logic (TOCL)
Complexity classes of equivalence problems revisited
Information and Computation
Different approaches to proof systems
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
| Hi-index | 0.00 |
We show that the class S"2^p is contained in ZPP^N^P. The proof uses universal hashing, approximate counting and witness sampling. As a consequence, a collapse first noticed by Samik Sengupta that the assumption NP has small circuits collapses PH to S"2^p becomes the strongest version to date of the Karp-Lipton Theorem. We also discuss the problem of finding irrefutable proofs for S"2^p in ZPP^N^P.