Statements (26)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
interactive proof system
|
| gptkbp:abbreviation |
gptkb:AM
|
| gptkbp:ArthurRole |
randomized polynomial-time verifier
|
| gptkbp:characterizedBy |
public-coin protocol
|
| gptkbp:complexity |
gptkb:AM
|
| gptkbp:field |
theoretical computer science
|
| gptkbp:generalizes |
MA (Merlin-Arthur)
|
| gptkbp:hasSubgroup |
IP (Interactive Proofs)
|
| https://www.w3.org/2000/01/rdf-schema#label |
Arthur-Merlin games
|
| gptkbp:includesPlayer |
gptkb:Arthur
gptkb:Merlin |
| gptkbp:introduced |
Laszlo Babai
|
| gptkbp:introducedIn |
1985
|
| gptkbp:MerlinRole |
computationally unbounded prover
|
| gptkbp:publishedIn |
Laszlo Babai, Trading group theory for randomness, 1985
|
| gptkbp:relatedTo |
gptkb:BPP
gptkb:PSPACE NP IP (Interactive Proofs) MA (Merlin-Arthur) |
| gptkbp:usedIn |
gptkb:complexity_theory
cryptography zero-knowledge proofs probabilistic proof systems |
| gptkbp:bfsParent |
gptkb:probabilistically_checkable_proofs
|
| gptkbp:bfsLayer |
6
|