More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP (Q3608306)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP |
scientific article; zbMATH DE number 5523060
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP |
scientific article; zbMATH DE number 5523060 |
Statements
More efficient queries in PCPs for NP and improved approximation hardness of maximum CSP (English)
0 references
4 March 2009
0 references
probabilistic proof systems
0 references
probabilistically checkable proofs
0 references
approximation hardness
0 references
query efficiency
0 references
0 references
0.8914579153060913
0 references
0.8634834289550781
0 references
0.8536006808280945
0 references
0.8379569053649902
0 references
