Free Bits, PCPs, and Nonapproximability---Towards Tight Results (Q4388899)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1150663
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Free Bits, PCPs, and Nonapproximability---Towards Tight Results |
scientific article; zbMATH DE number 1150663 |
Statements
Free Bits, PCPs, and Nonapproximability---Towards Tight Results (English)
0 references
10 May 1998
0 references
intractability
0 references
approximation
0 references
NP-hardness
0 references
probabilistic proof systems
0 references
0.8830300569534302
0 references
0.8597478866577148
0 references
0.8571859002113342
0 references
0.8545168042182922
0 references
