,

Parameterized Complexity Theory

Specificaties
Paperback, 495 blz. | Engels
Springer Berlin Heidelberg | 0e druk, 2010
ISBN13: 9783642067570
Rubricering
Springer Berlin Heidelberg 0e druk, 2010 9783642067570
€ 96,99
Levertijd ongeveer 8 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:9783642067570
Taal:Engels
Bindwijze:paperback
Aantal pagina's:495
Uitgever:Springer Berlin Heidelberg
Druk:0

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.
€ 96,99
Levertijd ongeveer 8 werkdagen

Rubrieken

    Personen

      Trefwoorden

        Parameterized Complexity Theory