Two Query Probabilistic Checking of Proofs with Subconstant Error
GPTKB entity
Statements (17)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:academic_journal
|
| gptkbp:author |
gptkb:Oded_Goldreich
gptkb:Irit_Dinur gptkb:Michael_Sudan gptkb:Shmuel_Safra |
| gptkbp:citation |
highly cited
|
| gptkbp:contribution |
shows that every NP statement has a two-query PCP with subconstant error
|
| gptkbp:field |
gptkb:complexity_theory
theoretical computer science |
| https://www.w3.org/2000/01/rdf-schema#label |
Two Query Probabilistic Checking of Proofs with Subconstant Error
|
| gptkbp:influenced |
hardness of approximation results
|
| gptkbp:publicationYear |
2000
|
| gptkbp:publishedIn |
gptkb:Proceedings_of_the_32nd_Annual_ACM_Symposium_on_Theory_of_Computing_(STOC_2000)
|
| gptkbp:topic |
gptkb:PCP_theorem
gptkb:probabilistically_checkable_proofs |
| gptkbp:bfsParent |
gptkb:Dana_Moshkovitz
|
| gptkbp:bfsLayer |
5
|