Parameterized Complexity Theory (eBook)

J. Flum, M. Grohe (Autoren)

eBook Download: PDF

2010 | 1. Auflage
XIII, 493 Seiten
Springer-Verlag
978-3-540-29953-0 (ISBN)

Infos

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.

Inhalt

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.

Produkt-Details

• Erscheint lt. Verlag: 12.2.2010
• Reihe/Serie: Texts in Theoretical Computer Science. An EATCS Series
• Sprache: englisch
• Themenwelt: Mathematik / Informatik ► Informatik ► Theorie / Studium
• Themenwelt: Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre
• Schlagworte: algorithm • algorithms • Automat • Automata • Complexity • Complexity theory • Computer • Linear Programming • Logic • Mathematical Logic • Optimization • parameterized complexity • programming • theoretical computer science • Tractability
• ISBN-10: 3-540-29953-X / 354029953X
• ISBN-13: 978-3-540-29953-0 / 9783540299530