Exact Exponential Algorithms (Paperback)

Lingua: inglese

Editore: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin, 2012

3642265669 / 9783642265662

Serie: Libro 32 di 45 - Texts in Theoretical Computer Science. An EATCS

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

Venditore con 5 stelle

Venditore AbeBooks dal 12 ottobre 2005

Brossura

Condizione: Nuovo

EUR 54,95

 Spedizione gratuita 
Spedito in U.S.A.

Quantità: 1 disponibile

Aggiungi al carrello
Resi gratuiti per 30 giorni

Descrizione dell’articolo da parte del venditore

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.…

Codice articolo 9783642265662

Titolo
Exact Exponential Algorithms (Paperback)
Autore
Fedor V. Fomin
Editore
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, Berlin
Anno di pubblicazione
2012
Condizione
new
Rilegatura
Paperback
Lingua
inglese
ISBN 10
3642265669
ISBN 13
9783642265662
Serie
Libro 32 di 45: Texts in Theoretical Computer Science. An EATCS

Grand Eagle Retail

Bensenville, IL, U.S.A.

Venditore con 5 stelle

Venditore AbeBooks dal 12 ottobre 2005

Tariffe di spedizione nazionale per U.S.A.

ArticoloDa 6 a 14 giorni lavorativiDa 6 a 16 giorni lavorativi
Primo articoloEUR 0,00EUR 0,00
I tempi di consegna sono stabiliti dai venditori e variano in base al corriere e al paese. Gli ordini che devono attraversare una dogana possono subire ritardi e spetta agli acquirenti pagare eventuali tariffe o dazi associati. I venditori possono contattarti in merito ad addebiti aggiuntivi dovuti a eventuali maggiorazioni dei costi di spedizione dei tuoi articoli.

Metodi di pagamento

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

Informazioni sull’azienda del venditore

APOLLO ONLINE CORP.

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