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 ...
Read More
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.
Read Less
Add this copy of Exact Exponential Algorithms (Texts in Theoretical to cart. $47.01, good condition, Sold by Anybook rated 5.0 out of 5 stars, ships from Lincoln, UNITED KINGDOM, published 2010 by Springer.
Edition:
2010, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Published:
2010
Language:
English
Alibris ID:
18311416654
Shipping Options:
Standard Shipping: $4.85
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
This is an ex-library book and may have the usual library/used-book markings inside. This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item, 550grams, ISBN: 9783642165320.
Add this copy of Exact Exponential Algorithms to cart. $102.44, like new condition, Sold by GreatBookPricesUK5 rated 4.0 out of 5 stars, ships from Castle Donington, DERBYSHIRE, UNITED KINGDOM, published 2012 by Springer-Verlag Berlin and Heidelberg GmbH & Co. K.
Edition:
2012, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Published:
2012
Language:
English
Alibris ID:
18195340000
Shipping Options:
Standard Shipping: $4.85
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine. Contains: Illustrations, black & white. Texts in Theoretical Computer Science. An EATCS Series . XIV, 206 p. 38 illus. Intended for professional and scholarly audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Exact Exponential Algorithms to cart. $107.42, new condition, Sold by GreatBookPricesUK5 rated 4.0 out of 5 stars, ships from Castle Donington, DERBYSHIRE, UNITED KINGDOM, published 2012 by Springer-Verlag Berlin and Heidelberg GmbH & Co. K.
Edition:
2012, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Published:
2012
Language:
English
Alibris ID:
18195470299
Shipping Options:
Standard Shipping: $4.85
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Contains: Illustrations, black & white. Texts in Theoretical Computer Science. An EATCS Series . XIV, 206 p. 38 illus. Intended for professional and scholarly audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Exact Exponential Algorithms to cart. $146.02, like new condition, Sold by GreatBookPricesUK5 rated 4.0 out of 5 stars, ships from Castle Donington, DERBYSHIRE, UNITED KINGDOM, published 2010 by Springer-Verlag Berlin and Heidelberg GmbH & Co. K.
Edition:
2010, Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Publisher:
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Published:
2010
Language:
English
Alibris ID:
18195430600
Shipping Options:
Standard Shipping: $4.85
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fine. Contains: Illustrations, black & white. Texts in Theoretical Computer Science. An EATCS Series . XIV, 206 p. 38 illus. Intended for professional and scholarly audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
