Interactive proofs and the hardness of approximating cliques (Q4371671)
From MaRDI portal
!
WARNING
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 1106106
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Interactive proofs and the hardness of approximating cliques |
scientific article; zbMATH DE number 1106106 |
Statements
Interactive proofs and the hardness of approximating cliques (English)
0 references
21 January 1998
0 references
approximation
0 references
nonnumerical algorithms
0 references
cliques
0 references
multi-prover interactive proofs
0 references
0.8913158
0 references
0.8817556
0 references
0.87529254
0 references
0.87356263
0 references
0.86991036
0 references
0.86636615
0 references
0.86625594
0 references
0.8647966
0 references
0.86358815
0 references
