Skip to content

Interactive Proof System

Defined in 2 lectures. Each definition is in that lecture's terms.

Definitions are written by AI from each lecture’s transcript. The time opens the lecture where the lecturer explains it.

  • A generalization of NP where an all-powerful prover interacts with a probabilistic verifier over multiple rounds.
    37:00Mathematics and Computation: The Landscape of P vs. NPAvi Wigderson · Institute for Advanced Study
  • A protocol involving a prover (Merlin) and a verifier (Arthur) where the prover tries to convince the verifier of a statement.
    1:14:54IP = PSPACERyan O'Donnell · Carnegie Mellon University