probabilistically checkable proof
Jump to navigation
Jump to search
English[edit]
Noun[edit]
probabilistically checkable proof (plural probabilistically checkable proofs) (abbreviated PCP)
- (computing theory) A reasonable proof of a computational theorem or conjecture obtained via a randomized algorithm.
See also[edit]
- PCP (complexity) on Wikipedia.Wikipedia