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
Connections
complexity class
Entity
NEXPTIME
Entity
International Standard Book Number
Entity
cryptography
Entity
mathematical proof
Entity
digital object identifier
Entity
University of Washington
Entity
New York University
Entity
formal language
Entity
Cambridge University Press
Entity
P versus NP problem
Entity
computational complexity theory
Entity
Q22908627
Entity
NP-complete
Entity
NP
Entity
alphabet
Entity
decision problem
Entity
P
Entity
regular language
Entity
NP-hard
Entity