the complexity class of languages that have interactive proofsThe interactive proof system is a concept in computational complexity theory that models computation as the exchange of messages between two parties. The parties, the verifier and the prover, interact by exchanging messages in order to ascertain whether a
This is a disambiguation page — a navigational aid which lists other pages that might otherwise share the same title. If an article link referred you here, you might want to go back and fix it to point directly to the intended page.