Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
theoretical computer science
|
| gptkbp:characterizedBy |
two-message interactive proof system
|
| gptkbp:contains |
NP
polynomial hierarchy |
| gptkbp:definedIn |
theoretical computer science
|
| gptkbp:hasSubgroup |
gptkb:IP_complexity_class
gptkb:MA_complexity_class Σ2P |
| https://www.w3.org/2000/01/rdf-schema#label |
AM complexity class
|
| gptkbp:introduced |
gptkb:László_Babai
|
| gptkbp:introducedIn |
1985
|
| gptkbp:numberOfIssues |
Graph Nonisomorphism
|
| gptkbp:prover |
gptkb:Merlin
|
| gptkbp:randomChance |
public coin
|
| gptkbp:referencedIn |
https://en.wikipedia.org/wiki/Arthur%E2%80%93Merlin_protocol
|
| gptkbp:relatedTo |
gptkb:IP_complexity_class
gptkb:MA_complexity_class interactive proof system BPP complexity class |
| gptkbp:standsFor |
Arthur-Merlin complexity class
|
| gptkbp:verifier |
gptkb:Arthur
|
| gptkbp:bfsParent |
gptkb:public-coin_interactive_proof
|
| gptkbp:bfsLayer |
6
|