We a good story
Quick delivery in the UK

Hardness of Approximation Between P and NP

part of the ACM Books series

About Hardness of Approximation Between P and NP

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.

Show more
  • Language:
  • English
  • ISBN:
  • 9781947487208
  • Binding:
  • Paperback
  • Pages:
  • 319
  • Published:
  • May 30, 2019
  • Dimensions:
  • 191x235x0 mm.
  • Weight:
  • 1 g.
Delivery: 2-4 weeks
Expected delivery: May 30, 2024

Description of Hardness of Approximation Between P and NP

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.

User ratings of Hardness of Approximation Between P and NP



Find similar books
The book Hardness of Approximation Between P and NP can be found in the following categories:

Join thousands of book lovers

Sign up to our newsletter and receive discounts and inspiration for your next reading experience.