Definition
In computational complexity theory, an Arthur–Merlin protocol, introduced by Babai (1985), is an interactive proof system in which the verifier's coin tosses are constrained to be public. Goldwasser & Sipser (1986) proved that all (formal) languages with interactive proofs of arbitrary length with private coins also have interactive proofs with public coins.
Related concepts
2-EXPTIMEAC0ACC0ALL (complexity)APXAdvice (complexity)Arithmetical hierarchyBPP (complexity)BQPBoolean hierarchyCC (complexity)Cambridge University PressCo-NPCo-NP-completeComplexity ZooComplexity classComputational complexity theoryDLOGTIMEDSPACEDTIMEDecision problemELEMENTARYEXPSPACEEXPTIMEExponential hierarchyExtended Riemann hypothesisFL (complexity)FNP (complexity)FP (complexity)Formal languageGraph isomorphism problemGrzegorczyk hierarchyIP (complexity)Interactive proof systemJohn Watrous (computer scientist)L (complexity)List of complexity classesLászló BabaiMichael SipserNC (complexity)NEXPTIMENL-completeNL (complexity)NONELEMENTARYNP-completenessNP-hardnessNP/polyNP (complexity)NSPACENTIMEOracle (computer science)P-completeP/polyPP (complexity)PR (complexity)PSPACEPSPACE-completeP (complexity)Parity PPolyLPolynomial hierarchyProbabilistically checkable proofQMAQuasi-polynomial timeRE (complexity)RL (complexity)RP (complexity)R (complexity)Random number generationRegular languageS2P (complexity)SC (complexity)SL (complexity)Sanjeev Arora (computer scientist)Shafi GoldwasserSipser–Lautemann theoremTC0TC (complexity)TFNPUP (complexity)ZPP (complexity)Zero knowledge proof♯P♯P-complete
7 concepts already in your glossary