‹ zurück Sie sind hier:  Startseite » Buchhändler » MARZIES.de Buch- und Medienhan… » Exact Exponential Algorithms

Linksbuch Neu neu Rechtsbuch

Fomin, Fedor V.; Kratsch, Dieter

Exact Exponential Algorithms (Gebundene Ausgabe)


Reihe: Texts in Theoretical Computer Science EATCS

Springer-Verlag GmbH, November 2010


203 S. - Sprache: Englisch - 247x166x18 mm Book

ISBN: 364216532X EAN: 9783642165320

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.


Preis: 58,84 EUR
Versandkosten: 0,00 EUR
Gesamtpreis: 58,84 EUR
In den Warenkorb

Anbieter: MARZIES.de Buch- und Medienhan… (Impressum/Lieferzeit)
Katalog: HC/Informatik

Angebotene Zahlungsarten: Vorauskasse
Transparente Bestellabwicklung - Verkäufer nutzt Order-Control - klicken für mehr Information
Transparente Bestellabwicklung -
Verkäufer nutzt Order-Control

 

Produktdetails

Textbook has been class-tested by the authors and their collaborators Text is supported throughout with exercises and notes for further reading Comprehensive introduction for researchersComprehensive introduction for researchers

Inhaltsverzeichnis

Branching.- Dynamic Programming.- Inclusion-Exclusion.- Treewidth.- Measure & Conquer.- Subset Convolution.- Local Search and SAT.- Split and List.- Time Versus Space.- Miscellaneous.- Conclusions, Open Problems and Further Directions.

Über den Autor

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


ISBN 3-642-16532-X

ISBN 978-3-642-16532-0

Buch empfehlen Buch empfehlen
Sparen Sie Versandkosten beim Kauf weiterer Artikel dieses Buchhändlers.

Computer Vision - ECCV 2008 10th European Conference on Computer Vision, Marseille, France, October von Forsyth, David (Herausgeber); Torr, Philip (Herausgeber); Zisserman, Andrew (Herausgeber)
129,99 EUR

The Deductive Spreadsheet von Cervesato, Iliano
139,99 EUR

Artificial Intelligence and Computational Intelligence 1 International Conference, AICI 2010, Sanya, von Wang, Fu Lee (Herausgeber); Deng, Hepu (Herausgeber); Lei, Jingsheng (Herausgeber)
96,29 EUR

80,24 EUR

96,29 EUR

Algebraic Biology Second International Conference, AB 2007, Castle of Hagenberg, Austria, July 2-4, von Anai, Hirokazu (Herausgeber); Horimoto, Katsuhisa (Herausgeber); Kutsia, Temur (Herausgeber)
79,99 EUR
Meine zuletzt angesehenen antiquarischen und neue Bücher
Meine letzten Buch Suchanfragen
    Noch keine Suchanfragen vorhanden.

© 2003 - 2018 by whSoft GmbH
Entdecken Sie außerdem: Antiquariatsportal · Achtung-Bücher.de · Booklink · Buchhai - Bücher Preisvergleich
Alle genannten Preise sind Bruttopreise und enthalten, soweit nicht anders vom Verkäufer angegeben, die gesetzliche Umsatzsteuer.