Tell your friends about this item:
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
Media | Books Paperback Book (Book with soft cover and glued back) |
Released | May 30, 2019 |
ISBN13 | 9781947487208 |
Publishers | Morgan & Claypool Publishers |
Pages | 319 |
Dimensions | 481 g (Weight (estimated)) |
See all of Aviad Rubinstein ( e.g. Paperback Book and Hardcover Book )