000			02166nam a22002057a 4500
005			20220715113610.0
008			220715b |||||||| |||| 00| 0 eng d
020			_a9783642067570
082			_a003.3 _bFLU
100			_a Jörg Flum;
245			_aParameterized complexity theory
260			_aBerlin : _bSpringer, _c©2006.
300			_a 493
505			_aFixed-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.
520			_aParameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the development of various new algorithmic techniques and a whole new theory of intractability." "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, and it presents detailed proofs of recent advanced results that have not appeared in book form before. Several chapters each are devoted to intractability, algorithmic techniques for designing fixed-parameter tractable algorithms, and bounded fixed-parameter tractability and subexponential time complexity. The treatment is comprehensive, and the reader is supported with exercises, notes, a detailed index, and some background on complexity theory and logic." "The book will be of interest to computer scientists, mathematicians and graduate students engaged with algorithms and problem complexity
650			_aComputational complexity.
650			_aAlgorithms.
700			_aM Grohe
942			_2ddc _cBK
999			_c1680 _d1680