ENGLISH

Parameterized Complexity Theory

By Jörg Flum , Martin Grohe

Book information

Publisher
Springer
Year
2006
ISBN
9783540299523, 3540299521
Language
english
Format
DJVU
Filesize
4 MB (4504530 bytes)
Series
Texts in Theoretical Computer Science. An EATCS Series
Pages
494\494
Topic
Computers
Time added
2014-10-05 02:30:00

Description

Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the development of various new algorithmic techniques and a whole new theory of intractability. This book is a state-of-the-art introduction to both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes, and it presents detailed proofs of recent advanced results that have not appeared in book form before. Several chapters are each devoted to intractability, algorithmic techniques for designing fixed-parameter tractable algorithms, and bounded fixed-parameter tractability and subexponential time complexity. The treatment is comprehensive, and the reader is supported with exercises, notes, a detailed index, and some background on complexity theory and logic. The book will be of interest to computer scientists, mathematicians and graduate students engaged with algorithms and problem complexity.

Similar books