Parameterized complexity theory
Author(s)
Bibliographic Information
Parameterized complexity theory
（Texts in theoretical computer science, An EATCS series）
Springer, c2006
- : pbk.
Available at / 15 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
"Softcover reprint of the hardcover 1st edition 2006" -- T.p. verso( pbk.)
Description and Table of Contents
Description
This book is a state-of-the-art introduction into both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes. It presents detailed proofs of recent advanced results that have not appeared in book form before and replaces the earlier publication "Parameterized Complexity" by Downey and Fellows as the definitive book on this subject. The book will interest computer scientists, mathematicians and graduate students engaged with algorithms and problem complexity.
Table of Contents
Fixed-Parameter Tractability.- Reductions and Parameterized Intractability.- The Class W[P].- Logic and Complexity.- Two Fundamental Hierarchies.- The First Level of the Hierarchies.- The W-Hierarchy.- The A- Hierarchy.- Kernelization and Linear Programming Techniques.- The Automata-Theoretic Approach.- Tree Width.- Planarity and Bounded Local Tree Width.- Homomorphisms and Embeddings.- Parameterized Counting Problems.- Bounded Fixed-Parameter Tractability.- Subexponential Fixed-Parameter Tractability.- Appendix, Background from Complexity Theory.- References.- Notation.- Index.
by "Nielsen BookData"
