PCP theorem
Sign in to savetheorem in complexity theory that every problem in NP has probabilistically checkable proofs
Connections
International Standard Book Number
Entity
mathematical proof
Entity
digital object identifier
Entity
International Standard Serial Number
Entity
bibcode
Entity
Q118398
Entity
Shafrira Goldwasser
Entity
computational complexity theory
Entity
Q22908627
Entity
László Lovász
Entity
NP
Entity
decision problem
Entity
boolean satisfiability problem
Entity
complexity class
Entity
NP-hard
Entity
Mathematical Reviews
Entity
independent set
Entity
lattice
Entity
randomized algorithm
Entity
computational complexity
Entity