Advanced
Theory of Computation
Q88 / 100
What is Arthur-Merlin protocol (AM class)?
Correct! Well done.
Incorrect.
The correct answer is B) An interactive proof system where Arthur (verifier) sends random coins publicly and Merlin (prover) responds; AM = IP with public coins
B
Correct Answer
An interactive proof system where Arthur (verifier) sends random coins publicly and Merlin (prover) responds; AM = IP with public coins
Explanation
AM protocols use public randomness (Arthur's coins visible to Merlin). AM = IP[O(1)] = NP^RP. Goldwasser-Sipser showed AM ⊆ IP. AM is believed to equal NP.
Progress
88/100