Dieses Buch kaufen
- Über dieses Lehrbuch
-
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.
- Stimmen zum Buch
-
From the reviews:
"The book is comprehensive and up-to-date. … The definitions are illustrated by good examples, the proofs are complete and proceed at a convenient pace, the connections and the implications of the results are spelled out clearly, the exercises are relevant. The book is recommended to specialists as a work of reference, as well as to beginners who want a solid introduction to the theory of parametrized computational problems." (Marius Zimand, Zentralblatt MATH, Vol. 1143, 2008)
- Inhaltsverzeichnis (16 Kapitel)
-
-
Fixed-Parameter Tractability
Seiten 1-31
-
Reductions and Parameterized Intractability
Seiten 33-43
-
The Class W[P]
Seiten 45-63
-
Logic and Complexity
Seiten 65-93
-
Two Fundamental Hierarchies
Seiten 95-103
-
Inhaltsverzeichnis (16 Kapitel)
Dieses Buch kaufen
Services zu diesem Buch
Wir empfehlen
Bibliografische Information
- Bibliographic Information
-
- Buchtitel
- Parameterized Complexity Theory
- Autoren
-
- J. Flum
- M. Grohe
- Titel der Buchreihe
- Texts in Theoretical Computer Science. An EATCS Series
- Copyright
- 2006
- Verlag
- Springer-Verlag Berlin Heidelberg
- Copyright Inhaber
- Springer-Verlag Berlin Heidelberg
- eBook ISBN
- 978-3-540-29953-0
- DOI
- 10.1007/3-540-29953-X
- Hardcover ISBN
- 978-3-540-29952-3
- Softcover ISBN
- 978-3-642-06757-0
- Buchreihen ISSN
- 1862-4499
- Auflage
- 1
- Seitenzahl
- XIII, 495
- Themen
*sofort verfügbar bei Bestellung eines Print-Titels, da es aufgrund der COVID-19-Situation zu Lieferverzögerungen kommen kann. Dieses Angebot ist befristet und richtet sich nach der Verfügbarkeit des eBook-Titels. Das eBook geht nicht in Ihren Besitz über - Sie erhalten einen zeitlich begrenzten Zugriff. Springer Reference Works sind davon ausgenommen.
