bn:00840624n
Noun Concept
Categories: Computational complexity theory
EN
interactive proof system  soundness  Interactive proof-system  interactive proof systems  Multi-prover interactive proof
EN
In computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between two parties: a prover and a verifier. Wikipedia
Definitions
Relations
Sources
EN
In computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between two parties: a prover and a verifier. Wikipedia
abstract machine used in computational complexity theory Wikidata