- Start
- Hardness of Approximation Between P and NP
Hardness of Approximation Between P and NP
Angebote / Angebote:
Understanding whether there is an efficient algorithm for approximate Nash equilibrium has been the central open problem in this field for the past decade. This book provides strong evidence that even finding an approximate Nash equilibrium is intractable.
Folgt in ca. 15 Arbeitstagen