Parameterized Complexity Theory (Texts i
β J. Flum, M. Grohe
π Library
π
2006
π Springer
π English
β¦ LIBER β¦
π
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
β Scribed by J. Flum, M. Grohe
- Publisher
- Springer
- Year
- 2006
- Tongue
- English
- Leaves
- 495
- 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
Elements of Finite Model Theory (Texts i
β Leonid Libkin
π Library
π
2004
π Springer
π English
<span>Finite model theory is an area of mathematical logic that grew out of computer science applications. The main sources of motivational examples for finite model theory are found in database theory, computational complexity, and formal languages, although in recent years connections with other a
Finite Model Theory and Its Applications
β Erich GrΓ€del, Phokion G. Kolaitis, Leonid Libkin, Maarten Marx, Joel Spencer, Mo
π Library
π
2007
π Springer
π English
<span>Finite model theory,as understoodhere, is an areaof mathematicallogic that has developed in close connection with applications to computer science, in particular the theory of computational complexity and database theory. One of the fundamental insights of mathematical logic is that our unders
DNA Computing: New Computing Paradigms (
π
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)
β Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa
π Library
π
2010
π Springer
π English
Theoretical Aspects of Distributed Compu
β Sotiris E. Nikoletseas
π Library
π English
Algorithms in Combinatorial Geometry (Mo
β Herbert Edelsbrunner
π Library
π
2004
π English