Advertisement

© 2006

Parameterized Complexity Theory

  • The previous definitive book on the area was the Springer title "Parameterized Complexity" by Downey and Fellows, which is now 6 years old.

  • There are many important new results in the area to introduce and explain, and this new book would replace that earlier title as the definitive book on this subject.

Textbook

About this book

Introduction

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.

Keywords

Algorithms Automat algorithm automata complexity complexity theory computer logic programming

Authors and affiliations

  1. 1.Abteilung für Mathematische LogikUniversität FreiburgFreiburgGermany
  2. 2.Institut für InformatikHumboldt UniversitätBerlinGermany

Bibliographic information

Industry Sectors
Electronics
IT & Software
Telecommunications
Engineering
Energy, Utilities & Environment
Aerospace

Reviews

From the reviews:

"The book is comprehensive and up-to-date. … The definitions are illustrated by good examples, the proofs are complete and proceed at a convenient pace, the connections and the implications of the results are spelled out clearly, the exercises are relevant. The book is recommended to specialists as a work of reference, as well as to beginners who want a solid introduction to the theory of parametrized computational problems." (Marius Zimand, Zentralblatt MATH, Vol. 1143, 2008)