Exact Exponential Algorithms (Paperback)

Language: English

Published by Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2012

3642265669 / 9783642265662

Series: Book 32 of 45 - Texts in Theoretical Computer Science. An EATCS

  • Softcover
  • New
See all details

Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.Grand Eagle Retail

5-star seller

AbeBooks seller since October 12, 2005

View this seller's items
Softcover

Condition: New

£ 46.97

 Free Shipping 
Ships within U.S.A.

Quantity: 1 available

Add to basket
Free 30-day returns

Item description from seller

Paperback. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Seller Inventory # 9783642265662

Title
Exact Exponential Algorithms (Paperback)
Author
Fedor V. Fomin
Publisher
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin
Publication year
2012
Condition
new
Binding
Paperback
Language
English
ISBN 10
3642265669
ISBN 13
9783642265662
Series
Book 32 of 45: Texts in Theoretical Computer Science. An EATCS

Grand Eagle Retail

Bensenville, IL, U.S.A.

5-star seller

AbeBooks seller since October 12, 2005

Shipping rates within U.S.A.

Item6 to 14 business days6 to 16 business days
First item£ 0.00£ 0.00
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.

Payment methods

  • Visa
  • Mastercard
  • American Express
  • Apple Pay
  • Google Pay

Seller's business information

APOLLO ONLINE CORP.

605 Geddes Street
Wilmington, DE U.S.A. 19805