Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:concerns |
gptkb:probabilistically_checkable_proofs
NP-hardness of approximation |
| gptkbp:field |
gptkb:theoretical_computer_science
|
| gptkbp:namedAfter |
gptkb:Sanjeev_Arora
gptkb:Shmuel_Safra |
| gptkbp:publishedIn |
gptkb:Journal_of_the_ACM
|
| gptkbp:relatedTo |
gptkb:NP-completeness
gptkb:PCP_theorem hardness of approximation |
| gptkbp:state |
Every NP problem has a probabilistically checkable proof with logarithmic randomness and constant query complexity
|
| gptkbp:yearProved |
1992
|
| gptkbp:bfsParent |
gptkb:Sanjeev_Arora
|
| gptkbp:bfsLayer |
5
|
| https://www.w3.org/2000/01/rdf-schema#label |
Arora–Safra theorem
|