Parameterized Complexity Theory

  • Jörg Flum
  • Martin Grohe
Book
Part of the Texts in Theoretical Computer Science. An EATCS Series book series (TTCS)

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

  • Jörg Flum
    • 1
  • Martin Grohe
    • 2
  1. 1.Abteilung für Mathematische LogikUniversität FreiburgFreiburgGermany
  2. 2.Institut für InformatikHumboldt UniversitätBerlinGermany

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-29953-X
  • Copyright Information Springer-Verlag Berlin Heidelberg 2006
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-29952-3
  • Online ISBN 978-3-540-29953-0
  • About this book