Items related to Exact Exponential Algorithms (Texts in Theoretical...

Exact Exponential Algorithms (Texts in Theoretical Computer Science. An EATCS Series) - Hardcover

 
9783642165320: Exact Exponential Algorithms (Texts in Theoretical Computer Science. An EATCS Series)

Synopsis

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.

"synopsis" may belong to another edition of this title.

About the Author

The authors are highly regarded academics and educators in theoretical computer science, and in algorithmics in particular.

From the Back Cover

Today most computer scientists believe that NP-hard problems cannot be solved by polynomial-time algorithms. From the polynomial-time perspective, all NP-complete problems are equivalent but their exponential-time properties vary widely. Why do some NP-hard problems appear to be easier than others? Are there algorithmic techniques for solving hard problems that are significantly faster than the exhaustive, brute-force methods? The algorithms that address these questions are known as exact exponential algorithms.

The history of exact exponential algorithms for NP-hard problems dates back to the 1960s. The two classical examples are Bellman, Held and Karp’s dynamic programming algorithm for the traveling salesman problem and Ryser’s inclusion–exclusion formula for the permanent of a matrix. The design and analysis of exact algorithms leads to a better understanding of hard problems and initiates interesting new combinatorial and algorithmic challenges. The last decade has witnessed a rapid development of the area, with many new algorithmic techniques discovered. This has transformed exact algorithms into a very active research field. This book provides an introduction to the area and explains the most common algorithmic techniques, and the text is supported throughout with exercises and detailed notes for further reading.

The book is intended for advanced students and researchers in computer science, operations research, optimization and combinatorics.

"About this title" may belong to another edition of this title.

Buy Used

Condition: Good
This is an ex-library book and...
View this item

US$ 16.22 shipping from United Kingdom to U.S.A.

Destination, rates & speeds

Buy New

View this item

US$ 6.49 shipping from Italy to U.S.A.

Destination, rates & speeds

Other Popular Editions of the Same Title

9783642265662: Exact Exponential Algorithms (Texts in Theoretical Computer Science. An EATCS Series)

Featured Edition

ISBN 10:  3642265669 ISBN 13:  9783642265662
Publisher: Springer, 2012
Softcover

Search results for Exact Exponential Algorithms (Texts in Theoretical...

Stock Image

Fomin, Fedor V.
Published by Springer, 2010
ISBN 10: 364216532X ISBN 13: 9783642165320
Used Hardcover

Seller: Anybook.com, Lincoln, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: Good. 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. Seller Inventory # 5832966

Contact seller

Buy Used

US$ 49.88
Convert currency
Shipping: US$ 16.22
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Fomin, Fedor V.; Kratsch, Dieter
Published by Springer, 2010
ISBN 10: 364216532X ISBN 13: 9783642165320
Used Hardcover

Seller: SpringBooks, Berlin, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Hardcover. Condition: As New. From Germany, will be dispatched immediately. Seller Inventory # CED-2402C-TEPPICHMILI-12-1000XS

Contact seller

Buy Used

US$ 47.39
Convert currency
Shipping: US$ 29.49
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Fomin, Fedor V.
Published by Springer, 2010
ISBN 10: 364216532X ISBN 13: 9783642165320
New Hardcover
Print on Demand

Seller: Brook Bookstore On Demand, Napoli, NA, Italy

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

Condition: new. Questo è un articolo print on demand. Seller Inventory # d2aadcde5eb1afaa90031e84519bd953

Contact seller

Buy New

US$ 80.50
Convert currency
Shipping: US$ 6.49
From Italy to U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Seller Image

Dieter Kratsch
ISBN 10: 364216532X ISBN 13: 9783642165320
New Hardcover
Print on Demand

Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 220 pp. Englisch. Seller Inventory # 9783642165320

Contact seller

Buy New

US$ 91.02
Convert currency
Shipping: US$ 27.14
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 2 available

Add to basket

Seller Image

Dieter Kratsch
ISBN 10: 364216532X ISBN 13: 9783642165320
New Hardcover

Seller: AHA-BUCH GmbH, Einbeck, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Seller Inventory # 9783642165320

Contact seller

Buy New

US$ 91.02
Convert currency
Shipping: US$ 35.98
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 1 available

Add to basket

Stock Image

Fedor V. Fomin Dieter Kratsch
Published by Springer, 2010
ISBN 10: 364216532X ISBN 13: 9783642165320
New Hardcover

Seller: Books Puddle, New York, NY, U.S.A.

Seller rating 4 out of 5 stars 4-star rating, Learn more about seller ratings

Condition: New. pp. 220. Seller Inventory # 262205210

Contact seller

Buy New

US$ 125.58
Convert currency
Shipping: US$ 3.99
Within U.S.A.
Destination, rates & speeds

Quantity: 4 available

Add to basket

Stock Image

Fomin Fedor V. Kratsch Dieter
Published by Springer, 2010
ISBN 10: 364216532X ISBN 13: 9783642165320
New Hardcover
Print on Demand

Seller: Majestic Books, Hounslow, United Kingdom

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. Print on Demand pp. 220 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. Seller Inventory # 5642693

Contact seller

Buy New

US$ 130.48
Convert currency
Shipping: US$ 8.87
From United Kingdom to U.S.A.
Destination, rates & speeds

Quantity: 4 available

Add to basket

Seller Image

Fedor V. Fomin|Dieter Kratsch
Published by Springer Berlin Heidelberg, 2010
ISBN 10: 364216532X ISBN 13: 9783642165320
New Hardcover
Print on Demand

Seller: moluna, Greven, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Gebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Textbook has been class-tested by the authors and their collaboratorsText is supported throughout with exercises and notes for further readingComprehensive introduction for researchersComprehensive introduction for researchersTh. Seller Inventory # 5051181

Contact seller

Buy New

US$ 85.48
Convert currency
Shipping: US$ 57.81
From Germany to U.S.A.
Destination, rates & speeds

Quantity: Over 20 available

Add to basket

Stock Image

Fomin Fedor V. Kratsch Dieter
Published by Springer, 2010
ISBN 10: 364216532X ISBN 13: 9783642165320
New Hardcover
Print on Demand

Seller: Biblios, Frankfurt am main, HESSE, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Condition: New. PRINT ON DEMAND pp. 220. Seller Inventory # 182205200

Contact seller

Buy New

US$ 146.08
Convert currency
Shipping: US$ 11.74
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 4 available

Add to basket

Seller Image

Dieter Kratsch
ISBN 10: 364216532X ISBN 13: 9783642165320
New Hardcover

Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany

Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

Buch. Condition: Neu. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 220 pp. Englisch. Seller Inventory # 9783642165320

Contact seller

Buy New

US$ 97.52
Convert currency
Shipping: US$ 64.90
From Germany to U.S.A.
Destination, rates & speeds

Quantity: 2 available

Add to basket