HAPPY HOLIDAYS: Get a special discount on Apress Access! Subscribe today >>

Texts in Theoretical Computer Science. An EATCS Series

Parameterized Complexity Theory

Authors: Flum, J., Grohe, M.

Buy this book

eBook $89.00
price for USA
  • ISBN 978-3-540-29953-0
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Download immediately after purchase
Hardcover $119.00
price for USA
  • ISBN 978-3-540-29952-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $119.00
price for USA
  • ISBN 978-3-642-06757-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this Textbook

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.

Reviews

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)


Table of contents (16 chapters)

Buy this book

eBook $89.00
price for USA
  • ISBN 978-3-540-29953-0
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Download immediately after purchase
Hardcover $119.00
price for USA
  • ISBN 978-3-540-29952-3
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Softcover $119.00
price for USA
  • ISBN 978-3-642-06757-0
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.

Services for this book

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Parameterized Complexity Theory
Authors
Series Title
Texts in Theoretical Computer Science. An EATCS Series
Copyright
2006
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
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
Series ISSN
1862-4499
Edition Number
1
Number of Pages
XIII, 495
Topics