interactive proof system
Sign in to savein computational complexity theory, an abstract machine modeling computation as two parties (an untrusted but powerful ‘prover’; a trusted ‘verifier’ with bounded resources) exchanging messages to ascertain whether some string belongs to a language
In the Vinony graph
Vinony's link graph records 114 inbound references to interactive proof system, and connects out to NP-complete, Arthur–Merlin protocol and International Standard Book Number.
It is catalogued under the topic Computational complexity theory.
Vinony links it to 11 Wikipedia language editions.
Connections
NP-complete
Entity
Arthur–Merlin protocol
Entity
International Standard Book Number
Entity
probability
Entity
Wayback Machine
Entity
cryptography
Entity
digital object identifier
Entity
International Standard Serial Number
Entity
Turing machine
Entity
arXiv
Entity
formal language
Entity
string
Entity
quantum computing
Entity
P versus NP problem
Entity
Shafrira Goldwasser
Entity
Adi Shamir
Entity
computational complexity theory
Entity
Semantic Scholar
Entity
Avi Wigderson
Entity
NP
Entity