Parameterized Complexity Theory
β JΓΆrg Flum, Martin Grohe
π Library
π
2006
π Springer
π English
β¦ LIBER β¦
π
Parameterized Complexity Theory
β Scribed by JΓΆrg Flum, Martin Grohe
- Publisher
- Springer
- Year
- 2006
- Tongue
- English
- Leaves
- 495
- Series
- Texts in Theoretical Computer Science. An EATCS Series
- Category
- Library
β¬ Acquire This Volume
No coin nor oath required. For personal study only.
β¦ Synopsis
Parameterized 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 to 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 are each 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.
π SIMILAR VOLUMES
Parameterized Complexity Theory
β Prof. Dr. JΓΆrg Flum, Prof. Dr. Martin Grohe (auth.)
π Library
π
2006
π Springer
π English
Parameterized Complexity Theory
β JΓΆrg Flum, Martin Grohe
π Library
π
2006
π Springer
π English
<P>Parameterized 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
Parameterized Complexity
β Rodney G. Downey, Michael R. Fellows
π Library
π
1999
π Springer
π English
<p>The idea for this book was conceived over the second bottle of Villa Maria's CaberΒ net Medot '89, at the dinner of the Australasian Combinatorics Conference held at Palmerston North, New Zealand in December 1990, where the authors first met and discovered they had a number of interests in common
Fundamentals of Parameterized Complexity
β Rodney G. Downey, Michael R. Fellows
π Library
π
2013
π Springer
π English
<p>This comprehensive and self-contained textbook presents an accessible overview of the state of the art of multivariate algorithmics and complexity. Increasingly, multivariate algorithmics is having significant practical impact in many application domains, with even more developments on the horizo
Parameterized Complexity in the Polynomi
β Ronald de Haan
π Library
π
2019
π Springer Berlin Heidelberg
π English
<p><p>Parameterized Complexity in the Polynomial Hierarchy was co-recipient of the E.W. Beth Dissertation Prize 2017 for outstanding dissertations in the fields of logic, language, and information. This work extends the theory of parameterized complexity to higher levels of the Polynomial Hierarchy