Browse using
OpenLink Faceted Browser
OpenLink Structured Data Editor
LodLive Browser
Formats
RDF:
N-Triples
N3
Turtle
JSON
XML
OData:
Atom
JSON
Microdata:
JSON
HTML
Embedded:
JSON
Turtle
Other:
CSV
JSON-LD
Faceted Browser
Sparql Endpoint
About:
PCP theorem
An Entity of Type:
Thing
,
from Named Graph:
http://dbpedia.org
,
within Data Space:
dbpedia.org
Theorem in complexity theory that every problem in NP has probabilistically checkable proofs
Property
Value
dbo:
description
mathematischer Satz
(de)
theorem in complexity theory that every problem in NP has probabilistically checkable proofs
(en)
dbo:
wikiPageExternalLink
http://groups.csail.mit.edu/cis/pubs/shafi/1996-jacm.pdf
dbo:
wikiPageWikiLink
dbr
:Constraint_satisfaction_problem
dbr
:Lattice_(group)
dbr
:Mathematical_proof
dbr
:Shafi_Goldwasser
dbr
:NP_(complexity)
dbr
:Ingo_Wegener
dbr
:Cook–Levin_theorem
dbr
:Maximum_independent_set
dbr
:Gödel_Prize
dbr
:QMA
dbr
:Probabilistically_checkable_proof
dbr
:Dorit_Aharonov
dbc
:Theorems_in_computational_complexity_theory
dbr
:Oded_Goldreich
dbr
:Carsten_Lund
dbr
:Irit_Dinur
dbr
:Lance_Fortnow
dbr
:Madhu_Sudan
dbr
:Mario_Szegedy
dbr
:Rajeev_Motwani
dbr
:Sanjeev_Arora
dbr
:Shmuel_Safra
dbr
:Uriel_Feige
dbr
:László_Lovász
dbr
:Promise_problem
dbr
:Computational_complexity_theory
dbr
:Boolean_satisfiability_problem
dbr
:Complexity_class
dbr
:Approximation_algorithm
dbr
:Interactive_proof_system
dbr
:Journal_of_the_ACM
dbr
:Expander_graph
dbr
:Hardness_of_approximation
dbc
:Randomized_algorithms
dbr
:Randomized_algorithm
dbr
:Decision_problem
dbr
:NP-hard
dbr
:Query_complexity
dbr
:NEXP
dbr
:NLTS_Conjecture
dbr
:Lattice_problems
dbr
:Computational_problems
dbr
:Quantum_PCP_Conjecture
dbp:
wikiPageUsesTemplate
dbt
:Reflist
dbt
:Citation
dbt
:Distinguish
dbt
:Harv
dbt
:Harvtxt
dbt
:Tmath
dbt
:Short_description
dct:
subject
dbc
:Theorems_in_computational_complexity_theory
dbc
:Quantum_information_theory
dbc
:Randomized_algorithms
rdfs:
label
PCP theorem
(en)
PCP-Theorem
(de)
Théorème PCP
(fr)
Теорема PCP
(ru)
Teorema PCP
(pt)
PCP-теорема
(uk)
owl:
differentFrom
dbr
:Post_correspondence_problem
owl:
sameAs
freebase
:PCP theorem
yago-res
:PCP theorem
wikidata
:PCP theorem
dbpedia-de
:PCP theorem
dbpedia-fr
:PCP theorem
dbpedia-pt
:PCP theorem
dbpedia-he
:PCP theorem
dbpedia-ru
:PCP theorem
dbpedia-uk
:PCP theorem
dbpedia-global
:PCP theorem
prov:
wasDerivedFrom
wikipedia-en
:PCP_theorem?oldid=1294042921&ns=0
foaf:
isPrimaryTopicOf
wikipedia-en
:PCP_theorem
is
dbo:
knownFor
of
dbr
:Sanjeev_Arora
is
dbo:
wikiPageDisambiguates
of
dbr
:PCP
is
dbo:
wikiPageRedirects
of
dbr
:Probabilistically_checkable_proof_theorem
dbr
:PCP_Characterization_Theorem
dbr
:PCP_Theorem
dbr
:PCP_characterization_theorem
dbr
:QPCP_theorem
dbr
:Quantum_PCP_theorem
is
dbo:
wikiPageWikiLink
of
dbr
:Vertex_cover
dbr
:Gödel_Prize
dbr
:Probabilistically_checkable_proof
dbr
:Irit_Dinur
dbr
:Johan_Håstad
dbr
:Rajeev_Motwani
dbr
:Sanjeev_Arora
dbr
:Shmuel_Safra
dbr
:Uriel_Feige
dbr
:List_of_University_of_California,_Berkeley_alumni
dbr
:Karloff–Zwick_algorithm
dbr
:Approximation_algorithm
dbr
:PCP
dbr
:Interactive_proof_system
dbr
:Expander_graph
dbr
:Hardness_of_approximation
dbr
:Computers_and_Intractability
dbr
:List_of_theorems
dbr
:Small-bias_sample_space
dbr
:List_of_computer_scientists
dbr
:Boolean_satisfiability_algorithm_heuristics
dbr
:MAX-3SAT
dbr
:Ruzsa–Szemerédi_problem
dbr
:SNP_(complexity)
dbr
:List_of_important_publications_in_theoretical_computer_science
dbr
:(SAT,_ε-UNSAT)
dbr
:Probabilistically_checkable_proof_theorem
dbr
:PCP_Characterization_Theorem
dbr
:PCP_Theorem
dbr
:PCP_characterization_theorem
dbr
:QPCP_theorem
dbr
:Quantum_PCP_theorem
is
dbp:
knownFor
of
dbr
:Sanjeev_Arora
is
owl:
differentFrom
of
dbr
:Post_correspondence_problem
is
foaf:
primaryTopic
of
wikipedia-en
:PCP_theorem
This content was extracted from
Wikipedia
and is licensed under the
Creative Commons Attribution-ShareAlike 4.0 International