Exact Exponential Algorithms

Download or Read eBook Exact Exponential Algorithms PDF written by Fedor V. Fomin and published by Springer Science & Business Media. This book was released on 2010-10-26 with total page 208 pages. Available in PDF, EPUB and Kindle.
Exact Exponential Algorithms
Author :
Publisher : Springer Science & Business Media
Total Pages : 208
Release :
ISBN-10 : 9783642165337
ISBN-13 : 3642165338
Rating : 4/5 (37 Downloads)

Book Synopsis Exact Exponential Algorithms by : Fedor V. Fomin

Book excerpt: 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.


Exact Exponential Algorithms Related Books

Exact Exponential Algorithms
Language: en
Pages: 208
Authors: Fedor V. Fomin
Categories: Mathematics
Type: BOOK - Published: 2010-10-26 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

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 ti
Exponential Time Algorithms
Language: en
Pages: 207
Authors: Serge Gaspers
Categories:
Type: BOOK - Published: 2010-02 - Publisher: Serge Gaspers

DOWNLOAD EBOOK

This book studies exponential time algorithms for NP-hard problems. In this modern area, the aim is to design algorithms for combinatorially hard problems that
Encyclopedia of Cryptography and Security
Language: en
Pages: 1457
Authors: Henk C.A. van Tilborg
Categories: Computers
Type: BOOK - Published: 2014-07-08 - Publisher: Springer Science & Business Media

DOWNLOAD EBOOK

Expanded into two volumes, the Second Edition of Springer’s Encyclopedia of Cryptography and Security brings the latest and most comprehensive coverage of the
Parameterized Algorithms
Language: en
Pages: 618
Authors: Marek Cygan
Categories: Computers
Type: BOOK - Published: 2015-07-20 - Publisher: Springer

DOWNLOAD EBOOK

This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained g
Computer Science
Language: en
Pages: 216
Authors: National Research Council
Categories: Computers
Type: BOOK - Published: 2004-10-06 - Publisher: National Academies Press

DOWNLOAD EBOOK

Computer Science: Reflections on the Field, Reflections from the Field provides a concise characterization of key ideas that lie at the core of computer science