Recomienda este artículo a tus amigos:
Hardness of Approximation Between P and NP Aviad Rubinstein
Hardness of Approximation Between P and NP
Aviad Rubinstein
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.
319 pages
| Medios de comunicación | Libros Paperback Book (Libro con tapa blanda y lomo encolado) |
| Publicado | 7 de junio de 2019 |
| ISBN13 | 9781947487208 |
| Editores | Morgan & Claypool Publishers |
| Páginas | 319 |
| Dimensiones | 150 × 220 × 10 mm · 553 g |
| Lengua | Inglés |