Exact Exponential Algorithms - Couverture souple

Fomin, Fedor V. V.; Kratsch, Dieter

9783642265662: Exact Exponential Algorithms

Couverture souple

ISBN 10 : 3642265669 ISBN 13 : 9783642265662

Editeur : Springer, 2012

Afficher les exemplaires de cette �dition comportant l?ISBN

0 D'occasion

9 Neuf

De EUR 48,37

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.

Les informations fournies dans la section � Synopsis � peuvent faire r�f�rence � une autre �dition de ce titre.

� propos de l?auteur

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

Les informations fournies dans la section � A propos du livre � peuvent faire r�f�rence � une autre �dition de ce titre.

�diteur: Springer
Date d'�dition: 2012
Langue: anglais
ISBN 10: 3642265669
ISBN 13: 9783642265662
Reliure: Broch�
Nombre de pages: 220
Coordonn�es du fabricant: non disponible

Acheter neuf

Afficher cet article

EUR 48,37

Autre devise

EUR 9,70 exp�dition depuis Allemagne vers France

Destinations, frais et d�lais

Ajouter au panier

Autres �ditions populaires du m�me titre

9783642165320: Exact Exponential Algorithms

Edition pr�sent�e

ISBN 10 : 364216532X ISBN 13 : 9783642165320
Editeur : Springer-Verlag Berlin and Heide..., 2010
Couverture rigide

Springer, 2010 (Couverture souple)

R�sultats de recherche pour Exact Exponential Algorithms

Image fournie par le vendeur

Exact Exponential Algorithms

Fedor V. Fomin|Dieter Kratsch

Edit� par Springer Berlin Heidelberg, 2012

ISBN 10 : 3642265669 ISBN 13 : 9783642265662

Neuf Couverture souple

impression � la demande

Vendeur : moluna, Greven, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Etat : 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. N� de r�f. du vendeur 5054622

Contacter le vendeur

Acheter neuf

EUR 48,37

Autre devise

Frais de port : EUR 9,70

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : Plus de 20 disponibles

Ajouter au panier

Image fournie par le vendeur

Exact Exponential Algorithms

Dieter Kratsch

Edit� par Springer Berlin Heidelberg, 2012

ISBN 10 : 3642265669 ISBN 13 : 9783642265662

Neuf Taschenbuch

Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : 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. N� de r�f. du vendeur 9783642265662

Contacter le vendeur

Acheter neuf

EUR 53,49

Autre devise

Frais de port : EUR 10,99

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 1 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Exact Exponential Algorithms

Dieter Kratsch

Edit� par Springer Berlin Heidelberg Dez 2012, 2012

ISBN 10 : 3642265669 ISBN 13 : 9783642265662

Neuf Taschenbuch

impression � la demande

Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : 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. N� de r�f. du vendeur 9783642265662

Contacter le vendeur

Acheter neuf

EUR 53,49

Autre devise

Frais de port : EUR 11

De Allemagne vers France

Destinations, frais et d�lais

Quantit� disponible : 2 disponible(s)

Ajouter au panier

Image fournie par le vendeur

Exact Exponential Algorithms

Dieter Kratsch

Edit� par Springer Berlin Heidelberg, Springer Berlin Heidelberg Dez 2012, 2012

ISBN 10 : 3642265669 ISBN 13 : 9783642265662

Neuf Taschenbuch

Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne

�valuation du vendeur 5 sur 5 �toiles

Taschenbuch. Etat : 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. N� de r�f. du vendeur 9783642265662

Contacter le vendeur