Exact exponential algorithms [electronic resource] / Fedor V. Fomin, Dieter Kratsch.

Today most computer scientists believe that NP-hard problems cannot be solved by polynomial-time algorithms. From the polynomial-time perspective, all NP-complete problems are equivalent but their exponential-time properties vary widely. Why do some NP-hard problems appear to be easier than others?...

Full description

Bibliographic Details

Online Access:	Full Text (via Springer)
Main Author:	Fomin, Fedor V.
Other Authors:	Kratsch, D. (Dieter)
Format:	Electronic eBook
Language:	English
Published:	Heidelberg : Springer, 2010.
Series:	Texts in theoretical computer science.
Subjects:	Computer algorithms.