Parameterized Complexity Theory

Cover
Springer Science & Business Media, 01.05.2006 - 495 Seiten

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.

 

Was andere dazu sagen - Rezension schreiben

Es wurden keine Rezensionen gefunden.

Ausgewählte Seiten

Inhalt

1
1
2
32
FPT
43
3
45
4
64
5
95
6
104
7
133
10
233
11
261
12
300
13
327
14
356
15
389
16
417
A
453

8
165
paraNP
193
9
206
Fig 96 The crown C
216
References
463
Notation
476
Urheberrecht

Andere Ausgaben - Alle anzeigen

Häufige Begriffe und Wortgruppen

Beliebte Passagen

Seite 468 - Math., 49:129-141, 1961. [Fag74] R. Fagin. Generalized first-order spectra and polynomial-time recognizable sets. In RM Karp, editor, Complexity of Computation, SIAM-AMS Proceedings, Vol. 7, pages 43-73, 1974.
Seite 469 - Strong' NP-completeness results: Motivation, examples, and implications. Journal of the ACM 25 (1978), 499-508.
Seite 474 - MY Vardi. On the complexity of bounded-variable queries. In Proceedings of the 14th ACM Symposium on Principles of Database Systems, pages 266-276, 1995.
Seite 10 - E) is a pair consisting of a set V of vertices, and a set E of edges joining some pairs of vertices.
Seite 474 - Power Indices and Easier Hard Problems," Mathematical Systems Theory Vol.

Über den Autor (2006)

Prof. Jvrg Flum, Abteilung f]r Mathematische Logik, Albert-Ludwigs-Universitdt Freiburg, Germany, http: //logik.mathematik.uni-freiburg.de/personen/Flum.html Prof. Martin Grohe, Institut f]r Informatik, Humboldt-Universitdt zu Berlin, Germany, http: //www.informatik.hu-berlin.de/~grohe/ The authors are very well qualified to write this book. In addition to their strong backgrounds in complexity, algorithms, etc., they have contributed a number of specific key results in parameterized complexity (e.g., http: //epubs.siam.org/sam-bin/dbq/article/42720). Jvrg Flum has coauthored two other Springer monographs: (i) "Mathematical Logic," Undergraduate Texts in Mathematics, 0-387-94258-0, 3rd printing since 1994, over 4000 copies sold, Heinz-Dieter Ebbinghaus, Jvrg Flum, Wolfgang Thomas, http: //www.springer.com/0-387-94258-0. (ii) "Finite Model Theory," Springer Monographs in Mathematics (was in series Perspectives in Mathematical Logic), printed in soft- and hardback, 1995, 2nd ed. in 1999, 2nd corr. print in 2006, Heinz-Dieter Ebbinghaus, Jvrg Flum, 3-540-28787-6, http: //www.springer.com/3-540-28787-6. In addition, Jvrg Flum coauthored the following LNM title: Vol. 769, "Topological Model Theory, 1980, 3-540-09732-5, Jvrg Flum, Martin Ziegler. And he coedited the following LNCS title: Vol. 1683, CSL 1999 conf. proc., Jvrg Flum, Mario Rodriguez-Artalejo, 1999, 3-540-66536-6. Prof. Martin Grohe has authored over 50 articles for refereed theoretical computer science journals and conference proceedings (http: //www.informatik.uni-trier.de/~ley/db/indices/a-tree/g/Grohe: Martin.html) in the areas of logic, complexity, algorithms, etc.

Bibliografische Informationen