Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
interactive proof system
|
| gptkbp:abbreviation |
gptkb:AM
|
| gptkbp:ArthurRole |
randomized polynomial-time verifier
|
| gptkbp:complexity |
gptkb:AM
|
| gptkbp:describedBy |
gptkb:Babai,_L._(1985)._Trading_group_theory_for_randomness._STOC_1985.
|
| gptkbp:feature |
gptkb:public_coin_protocol
interactive proof |
| gptkbp:field |
theoretical computer science
|
| gptkbp:generalizes |
MA protocol
NP proof |
| https://www.w3.org/2000/01/rdf-schema#label |
Arthur-Merlin protocol
|
| gptkbp:introduced |
gptkb:László_Babai
|
| gptkbp:introducedIn |
1985
|
| gptkbp:MerlinRole |
computationally unbounded prover
|
| gptkbp:participants |
gptkb:Arthur
gptkb:Merlin |
| gptkbp:relatedTo |
gptkb:BPP
gptkb:IP_(complexity_class) gptkb:Merlin-Arthur_protocol NP |
| gptkbp:usedIn |
gptkb:complexity_theory
|
| gptkbp:bfsParent |
gptkb:interactive_proof_systems
|
| gptkbp:bfsLayer |
5
|