Parameterized Complexity Theory

الغلاف الأمامي
Springer Science & Business Media, 01‏/05‏/2006 - 495 من الصفحات

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.

 

المحتوى

FixedParameter Tractability
1
Reductions and Parameterized Intractability
32
The Class WP
47
Logic and Complexity
90
The WHierarchy
137
1
162
Two Fundamental Hierarchies
165
Kernelization and Linear Programming Techniques
206
Planarity and Bounded Local Tree Width 301
300
Homomorphisms and Embeddings
327
Parameterized Counting Problems 357
356
Bounded FixedParameter Tractability
389
65
412
Subexponential FixedParameter Tractability
417
Background from Complexity Theory
453
References
463

The AutomataTheoretic Approach
233
Tree Width
261
57
299
72
466
Notation 477
476
حقوق النشر

طبعات أخرى - عرض جميع المقتطفات

عبارات ومصطلحات مألوفة

مقاطع مشهورة

الصفحة 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.
الصفحة 469 - Strong' NP-completeness results: Motivation, examples, and implications. Journal of the ACM 25 (1978), 499-508.
الصفحة 10 - E) is a pair consisting of a set V of vertices, and a set E of edges joining some pairs of vertices.

معلومات المراجع