On the Hardness of Approximating Some Optimization Problems That Are Supposedly Easier Than MAX CLIQUE (Q4852431)
From MaRDI portal
scientific article; zbMATH DE number 811355
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the Hardness of Approximating Some Optimization Problems That Are Supposedly Easier Than MAX CLIQUE |
scientific article; zbMATH DE number 811355 |
Statements
On the Hardness of Approximating Some Optimization Problems That Are Supposedly Easier Than MAX CLIQUE (English)
0 references
29 November 1995
0 references
multi-prover interactive proof systems
0 references
NP optimization problems
0 references
