probabilistically checkable proofs

GPTKB entity

Predicate	Object
gptkbp:instanceOf	gptkb:mathematical_concept
gptkbp:abbreviation	gptkb:PCP
gptkbp:centralTheorem	gptkb:PCP_theorem
gptkbp:characterizedBy	verifier reads only a small part of the proof verifier uses randomness
gptkbp:describes	proofs that can be checked by a randomized algorithm
gptkbp:field	theoretical computer science
https://www.w3.org/2000/01/rdf-schema#label	probabilistically checkable proofs
gptkbp:introducedIn	1990s
gptkbp:keyScientist	gptkb:Avi_Wigderson gptkb:László_Lovász gptkb:Madhu_Sudan gptkb:Sanjeev_Arora gptkb:Umesh_Vazirani gptkb:Shmuel_Safra
gptkbp:PCP_theorem_states	NP = PCP(log n, 1)
gptkbp:relatedTo	gptkb:complexity_theory gptkb:Unique_Games_Conjecture gptkb:Dinur's_proof_of_the_PCP_theorem gptkb:NP-completeness gptkb:Arthur-Merlin_games gptkb:Fourier_analysis_of_Boolean_functions gptkb:Håstad's_optimal_inapproximability_results gptkb:PCP_hierarchy completeness zero-knowledge proofs proof complexity randomized algorithms interactive proofs approximation algorithms soundness hardness of approximation property testing gap amplification query complexity NP-hardness of approximation gap problems hardness of Label Cover locally decodable codes locally testable codes long code proof length randomness complexity verifier
gptkbp:usedIn	coding theory cryptography inapproximability results proof verification
gptkbp:bfsParent	gptkb:interactive_proof_systems gptkb:Dana_Moshkovitz gptkb:László_Babai gptkb:Madhu_Sudan gptkb:Sanjeev_Arora
gptkbp:bfsLayer	5