Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03511641n
Noun Concept
Categories: Articles with short description, Randomized algorithms
EN
Arthur–Merlin protocol  AM  Arthur-Merlin  Arthur-Merlin protocol  coAM  MA
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
Definitions
Sources
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
interactive proof system in computational complexity theory Wikidata
Wikipedia
EN
Arthur–Merlin protocol
Wikidata
EN
Arthur–Merlin protocol
Wikipedia Redirections
EN
AM (complexity), Arthur-Merlin, Arthur-Merlin protocol, coAM, MA (complexity), Merlin-Arthur protocol

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License