Statements (25)
Predicate | Object |
---|---|
gptkbp:instanceOf |
theoretical computer science
|
gptkbp:contains |
decision problems
|
gptkbp:definedIn |
interactive proof system
|
gptkbp:hasProver |
gptkb:Merlin
|
gptkbp:hasSubgroup |
gptkb:NP_complexity_class
gptkb:AM_complexity_class |
gptkbp:hasVerifier |
gptkb:Arthur
|
https://www.w3.org/2000/01/rdf-schema#label |
MA complexity class
|
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 |
theoretical computer science
|
gptkbp:verifierIs |
probabilistic polynomial time
|
gptkbp:bfsParent |
gptkb:public-coin_interactive_proof
|
gptkbp:bfsLayer |
6
|