Andere Kunden interessierten sich auch für
![Exact Exponential Algorithms]( "Exact Exponential Algorithms")
Exact Exponential Algorithms37,99 €![Integer Programming and Combinatorial Optimization]( "Integer Programming and Combinatorial Optimization")
Integer Programming and Combinatorial Optimization37,99 €![Graph-Theoretic Concepts in Computer Science]( "Graph-Theoretic Concepts in Computer Science")
Graph-Theoretic Concepts in Computer Science42,99 €![Parameterized and Exact Computation]( "Parameterized and Exact Computation")
Parameterized and Exact Computation37,99 €![Integer Programming and Combinatorial Optimization]( "Integer Programming and Combinatorial Optimization")
Integer Programming and Combinatorial Optimization42,99 €![Parameterized and Exact Computation]( "Parameterized and Exact Computation")
Parameterized and Exact Computation42,99 €![Combinatorics, Algorithms, Probabilistic and Experimental Methodologies]( "Combinatorics, Algorithms, Probabilistic and Experimental Methodologies")
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies42,99 €
Exact Exponential Algorithms provides an introduction to the area and explains the most common algorithmic techniques involved. Thorough exercises are included, in addition to notes and suggestions for further reading.
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 force search. Three classic examples are the following algorithms for the TRAVELLING SALESMAN problem, MAXIMUM INDEPENDENT SET, and COLORING.
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 force search. Three classic examples are the following algorithms for the TRAVELLING SALESMAN problem, MAXIMUM INDEPENDENT SET, and COLORING.