Buch, Englisch, 495 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 768 g
Reihe: Texts in Theoretical Computer Science. An EATCS Series
Buch, Englisch, 495 Seiten, Previously published in hardcover, Format (B × H): 155 mm x 235 mm, Gewicht: 768 g
Reihe: Texts in Theoretical Computer Science. An EATCS Series
ISBN: 978-3-642-06757-0
Verlag: Springer
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.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Numerische Mathematik
- Mathematik | Informatik EDV | Informatik Informatik Rechnerarchitektur
- Mathematik | Informatik EDV | Informatik Informatik Berechenbarkeitstheorie, Komplexitätstheorie
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
- Mathematik | Informatik Mathematik Mathematik Allgemein Grundlagen der Mathematik
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
- Mathematik | Informatik Mathematik Mathematik Allgemein Mathematische Logik
Weitere Infos & Material
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 and Limited Nondeterminism.- Subexponential Fixed-Parameter Tractability.
