Probabilistically checkable proof
id:
probabilistically-checkable-proof-163-15553413
title:
Probabilistically checkable proof
text:
In computational complexity theory, a probabilistically checkable proof (PCP) 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. The algorithm is then required to accept correct proofs and reject incorrect proofs with very high probability. A standard proof (or certificate), as used in the verifier-based definition of the complexity class NP, also satisfies these requirements, since the checking
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Probabilistically_checkable_proof
date created:
2004-03-04T16:33:26Z
date modified:
2024-08-28T19:38:43Z
main entity:
{"identifier":"Q841495","url":"https://www.wikidata.org/entity/Q841495"}
image:
fields total:
13
integrity:
14