Le livre est actuellement en rupture de stock
En savoir plus sur le livre
Exploring the realm of slow algorithms, this book delves into exponential time algorithms that often arise in complex problem-solving. It discusses the nature of NP-complete problems, suggesting that polynomial time solutions may not exist for many natural issues. While brute force search can solve all combinatorial problems, the text highlights that some NP-complete problems can be addressed more efficiently, showcasing notable algorithms for the Travelling Salesman problem, Maximum Independent Set, and Coloring.
Achat du livre
Exact Exponential Algorithms, Fedor V. Fomin, Dieter Kratsch
- Langue
- Année de publication
- 2010
- product-detail.submit-box.info.binding
- (rigide)
Nous vous informerons par e-mail dès que nous l’aurons retrouvé.
Modes de paiement
Il manque plus que ton avis ici.