Statements (25)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:theoretical_computer_science
|
| gptkbp:contains |
gptkb:decision_problems
|
| gptkbp:definedIn |
gptkb:interactive_proof_system
|
| gptkbp:hasProver |
gptkb:Merlin
|
| gptkbp:hasSubgroup |
gptkb:NP_complexity_class
gptkb:AM_complexity_class |
| gptkbp:hasVerifier |
gptkb:Arthur
|
| gptkbp:introduced |
Laszlo Babai
|
| gptkbp:introducedIn |
1985
|
| gptkbp:proofType |
randomized proof
|
| gptkbp:proverIs |
unbounded computational power
|
| gptkbp:referencedIn |
https://en.wikipedia.org/wiki/MA_(complexity)
|
| gptkbp:relatedTo |
gptkb:NP_complexity_class
gptkb:Arthur-Merlin_protocol gptkb:AM_complexity_class BPP complexity class |
| gptkbp:standsFor |
Merlin-Arthur complexity class
|
| gptkbp:unknownRelationTo |
gptkb:NP_complexity_class
gptkb:AM_complexity_class BPP complexity class |
| gptkbp:usedIn |
gptkb:theoretical_computer_science
|
| gptkbp:verifierIs |
probabilistic polynomial time
|
| gptkbp:bfsParent |
gptkb:public-coin_interactive_proof
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
MA complexity class
|