probabilistically checkable proof
Sign in to saveAlso known as PCP
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
Wikidata facts
- Subclass of
- mathematical proof
Show 1 more fact
- short name
- PCP
Sources (1)
via Wikidata · CC0