Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03288332n
Noun Concept
Categories: Mathematical proofs, Randomized algorithms
EN
probabilistically checkable proof  Holographic Proof  PCP  PCP theory  Probabilistically-checkable proof
EN
In computational complexity theory, a probabilistically checkable proof is a type of proof that can be checked by a randomized algorithm using a bounded amount of randomness and reading a bounded number of bits of the proof. Wikipedia
English:
complexity
Definitions
Relations
Sources
EN
In computational complexity theory, a probabilistically checkable proof is a type of proof that can be checked by a randomized algorithm using a bounded amount of randomness and reading a bounded number of bits of the proof. Wikipedia
A notion in the theory of computational complexity Wikipedia Disambiguation
A reasonable proof of a computational theorem or conjecture obtained via a randomized algorithm. Wiktionary
IS A
mathematical proof
Wikipedia
EN
probabilistically checkable proof
Wikidata
EN
probabilistically checkable proof
Wiktionary
EN
probabilistically checkable proof
Wikipedia Redirections
EN
Holographic Proof, PCP (complexity), PCP theory, Probabilistically-checkable proof, Probabilistically Checkable Proof, Probabilistically checkable proof (complexity), probabilistically checkable proofs, Transparent Proof
Wikidata Alias
EN
PCP

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