Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
interactive proof system
|
| gptkbp:complexity |
gptkb:AM
|
| gptkbp:describes |
A class of interactive proof systems with two parties: Arthur (a probabilistic polynomial-time verifier) and Merlin (an all-powerful prover).
|
| gptkbp:field |
theoretical computer science
|
| https://www.w3.org/2000/01/rdf-schema#label |
Arthur–Merlin protocol
|
| gptkbp:introduced |
gptkb:László_Babai
|
| gptkbp:introducedIn |
1985
|
| gptkbp:namedAfter |
gptkb:Arthur
gptkb:Merlin |
| gptkbp:notableFor |
Arthur can use randomness
Merlin cannot see Arthur's random choices |
| gptkbp:relatedTo |
gptkb:IP_(complexity_class)
zero-knowledge proof interactive proof AM (complexity class) |
| gptkbp:bfsParent |
gptkb:public-coin_interactive_proof
|
| gptkbp:bfsLayer |
6
|