Overview
- 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.
- Includes supplementary material: sn.pub/extras
Part of the book series: Texts in Theoretical Computer Science. An EATCS Series (TTCS)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
About this book
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
Table of contents (16 chapters)
-
Front Matter
-
Back Matter
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)
Authors and Affiliations
Bibliographic Information
Book Title: Parameterized Complexity Theory
Authors: Jörg Flum, Martin Grohe
Series Title: Texts in Theoretical Computer Science. An EATCS Series
DOI: https://doi.org/10.1007/3-540-29953-X
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2006
Hardcover ISBN: 978-3-540-29952-3Published: 09 February 2006
Softcover ISBN: 978-3-642-06757-0Published: 12 February 2010
eBook ISBN: 978-3-540-29953-0Published: 01 May 2006
Series ISSN: 1862-4499
Series E-ISSN: 1862-4502
Edition Number: 1
Number of Pages: XIII, 495
Topics: Computer System Implementation, Mathematical Logic and Foundations, Algorithm Analysis and Problem Complexity, Theory of Computation, Computation by Abstract Devices, Mathematical Logic and Formal Languages