Multi-prover interactive proofs
MIP is the class of languages with an interactive proof in which a probabilistic polynomial-time verifier interacts with two or more computationally unbounded provers who cannot communicate with one another; MIP = NEXP — BFL90.
TODO: syntax and security definition.
Participates in
Builds on Multi-prover interactive proofs
Barriers