bn:03511641n
Noun Concept
EL
No term available
EN
In computational complexity theory, an Arthur–Merlin protocol, introduced by Babai, is an interactive proof system in which the verifier's coin tosses are constrained to be public. Wikipedia
Sources