Jump to content

Probabilistically checkable proof

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Arvindn (talk | contribs) at 16:33, 4 March 2004 ({{msg:stub}}). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

In computational complexity theory, PCP is a class of decision problems having probabilistically checkable proofs.

A PCP can be viewed as an interactive proof system in which the prover is a memoryless oracle (essentially a string) and the verifier is a randomized algorithm. For an input which belongs to the language (a YES-instance), there exists an oracle (or proof) for which the verifier accepts with certainty; for NO-instances, the verifier rejects with probability at least 1/2, whatever be the oracle (compare RP).

This article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Probabilistically_checkable_proof&oldid=2626695"