Explore relationships

Arthur–Merlin Protocol

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 (i.e. known to the prover too). Goldwasser & Sipser (1986) proved that all (formal) language…

Use + to expand a branch. Click a topic name to open its summary.