Statements (14)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
computational complexity theory concept
|
| gptkbp:describes |
relationship between proof systems and complexity classes
|
| gptkbp:generalizes |
gptkb:PCP_theorem
|
| https://www.w3.org/2000/01/rdf-schema#label |
PCP hierarchy
|
| gptkbp:influenced |
inapproximability results
|
| gptkbp:introducedIn |
1990s
|
| gptkbp:level |
PCP[r,q] for various r and q
|
| gptkbp:relatedTo |
gptkb:PCP_theorem
gptkb:probabilistically_checkable_proofs theoretical computer science |
| gptkbp:studies |
tradeoff between randomness and query complexity in proof verification
|
| gptkbp:usedIn |
hardness of approximation
|
| gptkbp:bfsParent |
gptkb:probabilistically_checkable_proofs
|
| gptkbp:bfsLayer |
6
|