Are there interactive protocols for co-NP languages?
References (8)
- et al.
Does co-NP have short interactive proofs?
Inform. Process. Lett.
(1987) - et al.
On the power of interaction
Proc. 27th Conf. on Fundamentals of Computer Science
(1986) Trading group theory for randomness
Proc. 17th Symp. on Theory of Computing
(1985)- et al.
Relativizations of the P = NP questions
SIAM J. Comput.
(1975)
There are more references available in the full text version of this article.
Cited by (58)
Chapter 4 A Status Report on the P Versus NP Question
2009, Advances in ComputersError-bounded probabilistic computations between MA and AM
2006, Journal of Computer and System SciencesInteractive and probabilistic proof-checking
2000, Annals of Pure and Applied LogicA Tight Relationship between Generic Oracles and Type-2 Complexity Theory
1997, Information and ComputationBounded Relativization
2023, Leibniz International Proceedings in Informatics, LIPIcsComplexity theory
2022, Computing Handbook: Two-Volume Set
- ∗
Supported by an Office of Naval Research fellowship.
- †
This work was done while both authors were with the University of California at Berkeley.
- ∗∗
Supported by the National Science Foundation under Grant No. DCR-8602062 and by the Air Force under Grant No.AFOSR-86-0078.
Copyright © 1988 Published by Elsevier B.V.