Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques (Q4910937): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-33996-7_9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W207653415 / rank | |||
Normal rank | |||
Latest revision as of 23:09, 19 March 2024
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
