|
gptkbp:instanceOf
|
gptkb:mathematical_concept
|
|
gptkbp:category
|
proof complexity
approximation algorithms
theorems in computational complexity theory
|
|
gptkbp:consequence
|
hardness of approximating MAX-3SAT
hardness of approximating MAX-CUT
hardness of approximating Steiner tree
hardness of approximating TSP
hardness of approximating clique
hardness of approximating coloring
hardness of approximating graph coloring
hardness of approximating independent set
hardness of approximating set cover
hardness of approximating vertex cover
hardness of approximating various constraint satisfaction problems
inapproximability results for optimization problems
|
|
gptkbp:field
|
gptkb:theoretical_computer_science
|
|
gptkbp:fullName
|
gptkb:Probabilistically_Checkable_Proofs_theorem
|
|
gptkbp:implies
|
hardness of approximation
|
|
gptkbp:provenBy
|
gptkb:Rajeev_Motwani
gptkb:Madhu_Sudan
gptkb:Sanjeev_Arora
gptkb:Shmuel_Safra
gptkb:Carsten_Lund
|
|
gptkbp:publishedIn
|
gptkb:Journal_of_the_ACM
|
|
gptkbp:relatedTo
|
gptkb:NP-completeness
gptkb:probabilistically_checkable_proofs
approximation algorithms
|
|
gptkbp:state
|
NP = PCP(log n, 1)
|
|
gptkbp:yearProved
|
1992
|
|
gptkbp:bfsParent
|
gptkb:Arora–Safra_theorem
gptkb:Two_Query_Probabilistic_Checking_of_Proofs_with_Subconstant_Error
gptkb:Blum-Luby-Rubinfeld_linearity_test
gptkb:Dinur's_proof_of_the_PCP_theorem
gptkb:probabilistically_checkable_proofs
|
|
gptkbp:bfsLayer
|
6
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
PCP theorem
|