,

Parameterized Complexity Theory

Gebonden Engels 2006 9783540299523
Verwachte levertijd ongeveer 9 werkdagen

Samenvatting

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.

Specificaties

ISBN13:9783540299523
Taal:Engels
Bindwijze:gebonden
Uitgever:Springer Berlin Heidelberg

Lezersrecensies

Wees de eerste die een lezersrecensie schrijft!

Inhoudsopgave

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.

Managementboek Top 100

Rubrieken

    Personen

      Trefwoorden

        Parameterized Complexity Theory