Does co-NP have short interactive proofs?
Abstract Babai (1985) and Goldwasser, Micali and Rackoff (1985) introduced two
probabilistic extensions of the complexity class NP. The two complexity classes, denoted AM
[Q] and IP [Q] respectively, are defined using randomized interactive proofs between a
prover and a verifier. Goldwasser and Sipser (1986) proved that the two classes are equal.
We prove that if the complexity class co-NP is contained in IP [k] for some constant k (ie, if
every language in co-NP has a short interactive proof), then the polynomial-time hierarchy …
probabilistic extensions of the complexity class NP. The two complexity classes, denoted AM
[Q] and IP [Q] respectively, are defined using randomized interactive proofs between a
prover and a verifier. Goldwasser and Sipser (1986) proved that the two classes are equal.
We prove that if the complexity class co-NP is contained in IP [k] for some constant k (ie, if
every language in co-NP has a short interactive proof), then the polynomial-time hierarchy …