A decisive characterization of BPP
Information and Control
The knowledge complexity of interactive proof-systems
STOC '85 Proceedings of the seventeenth 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
Does co-NP have short interactive proofs?
Information Processing Letters
Probabilistic quantifiers vs. distrustful adversaries
Proc. of the seventh conference on Foundations of software technology and theoretical computer science
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
Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth 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
Approximating clique is almost NP-complete (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
If NP has polynomial-size circuits, then MA=AM
Theoretical Computer Science
More on BPP and the polynomial-time hierarchy
Information Processing Letters
Symmetric alternation captures BPP
Computational Complexity
Computability and complexity theory
Computability and complexity theory
Competing Provers Yield Improved Karp-Lipton Collapse Results
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Superpolynomial Circuits, Almost Sparse Oracles and the Exponential Hierarchy
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Proof verification and hardness of approximation problems
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
On the round complexity of zero-knowledge proofs based on one-way permutations
LATINCRYPT'10 Proceedings of the First international conference on Progress in cryptology: cryptology and information security in Latin America
Weak compositions and their applications to polynomial lower bounds for kernelization
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 5.23 |
If every language in coNP has a constant-round interactive proof system, then the polynomial-time hierarchy collapses [R.B. Boppana, J. Håstad, S. Zachos, Does co-NP have short interactive proofs? Information Processing Letters 25 (2) (1987) 127-132]. On the other hand, the well-known LFKN protocol gives O(n)-round interactive proof systems for all languages in coNP [C. Lund, L. Fortnow, H. Karloff, N. Nisan, Algebraic methods for interactive proof systems, Journal of the Association for Computing Machinery 39 (4) (1992) 859-868]. We consider the question of whether it is possible for coNP to have interactive proof systems with polylogarithmic-round complexity. We show that this is unlikely by proving that if a coNP-complete set has a polylogarithmic-round interactive proof system, then the exponential-time hierarchy collapses. We also consider exponential versions of the Karp-Lipton theorem and Yap's theorem.