Il libro è attualmente esaurito
Maggiori informazioni sul libro
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.
Acquisto del libro
Exact Exponential Algorithms, Fedor V. Fomin, Dieter Kratsch
- Lingua
- Pubblicato
- 2010
- product-detail.submit-box.info.binding
- (Copertina rigida)
Ti avviseremo via email non appena lo rintracceremo.
Metodi di pagamento
Qui potrebbe esserci la tua recensione.