Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:00840624n
Noun Concept
AR
No term available
EN
In computational complexity theory, an interactive proof system is an abstract machine that models computation as the exchange of messages between two parties: a prover and a verifier. Wikipedia
Relations
Sources
HAS KIND
الإثبات بلا كشف
EN
Arthur–Merlin 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