Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques (Q4910937)
From MaRDI portal
scientific article; zbMATH DE number 6144471
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques |
scientific article; zbMATH DE number 6144471 |
Statements
Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques (English)
0 references
13 March 2013
0 references
