Hardness of Approximation Between P and NP by 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.-
The Continuing Arms Race
-
Verified Functional Programming in Agda
-
The Essentials of Modern Software Engineering
-
The Handbook of Multimodal-Multisensor Interfaces, Volume 1
-
Declarative Logic Programming
-
Text Data Management and Analysis
-
Prophets of Computing
-
Effective Theories in Programming Practice
-
The VR Book
-
Weaving Fire Into Form
-
Edsger Wybe Dijkstra
-
Democratizing Cryptography
-
On Monotonicity Testing and the 2-to-2 Games Conjecture
-
The Handbook on Socially Interactive Agents
-
Frontiers of Multimedia Research
-
The Sparse Fourier Transform
-
Shared-Memory Parallelism Can Be Simple, Fast, and Scalable
-
Communities of Computing
-
An Architecture for Fast and General Data Processing on Large Clusters
-
Computational Prediction of Protein Complexes from Protein Interaction Networks
-
Reactive Internet Programming
-
The Handbook of Multimodal-Multisensor Interfaces, Volume 2
-
Smarter Than Their Machines
-
Embracing Interference in Wireless Systems
Rubinstein, Aviad: - Aviad Rubinstein is an Assistant Professor of Computer Science at Stanford University. Before coming to Stanford he received his Ph.D. from the Univerity of California, Berkeley, and spent one year as a Rabin Postdoctoral Fellow at Harvard University.
| SKU | Unavailable |
| ISBN 13 | 9781947487208 |
| ISBN 10 | 1947487205 |
| Title | Hardness of Approximation Between P and NP |
| Author | Aviad Rubinstein |
| Series | Acm Bks |
| Condition | Unavailable |
| Binding Type | Paperback |
| Publisher | Morgan & Claypool Publishers |
| Year published | 2019-05-30 |
| Number of pages | 319 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |