| 书目名称 | Exact Exponential Algorithms |
| 编辑 | Fedor V. Fomin,Dieter Kratsch |
| 视频video | |
| 概述 | Textbook has been class-tested by the authors and their collaborators.Text is supported throughout with exercises and notes for further reading.Comprehensive introduction for researchers.Includes supp |
| 丛书名称 | Texts in Theoretical Computer Science. An EATCS Series |
| 图书封面 |  |
| 描述 | For a long time computer scientists have distinguished between fast and slow algo rithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is bounded by some polynomial in the length of the input. All other algorithms are slow (or bad). The running time of slow algorithms is usually exponential. This book is about bad algorithms. There are several reasons why we are interested in exponential time algorithms. Most of us believe that there are many natural problems which cannot be solved by polynomial time algorithms. The most famous and oldest family of hard problems is the family of NP complete problems. Most likely there are no polynomial time al gorithms solving these hard problems and in the worst case scenario the exponential running time is unavoidable. Every combinatorial problem is solvable in ?nite time by enumerating all possi ble solutions, i. e. by brute force search. But is brute force search always unavoid able? De?nitely not. Already in the nineteen sixties and seventies it was known that some NP complete problems can be solved signi?cantly faster than by brute |
| 出版日期 | Textbook 2010 |
| 关键词 | Branching; Combinatorics; Dynamic programming; Exact algorithms; Exponential algorithms; Graph; Hard optim |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-642-16533-7 |
| isbn_softcover | 978-3-642-26566-2 |
| isbn_ebook | 978-3-642-16533-7Series ISSN 1862-4499 Series E-ISSN 1862-4502 |
| issn_series | 1862-4499 |
| copyright | Springer-Verlag Berlin Heidelberg 2010 |
发表于 2025-3-21 16:49:55
