Item description for Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) by J. Flum & M. Grohe...
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.
Promise Angels is dedicated to bringing you great books at great prices. Whether you read for entertainment, to learn, or for literacy - you will find what you want at promiseangels.com!
Est. Packaging Dimensions: Length: 1" Width: 6.25" Height: 9.25" Weight: 2.15 lbs.
Release Date Mar 16, 2006
ISBN 3540299521 ISBN13 9783540299523
Availability 88 units. Availability accurate as of May 26, 2017 10:40.
Usually ships within one to two business days from La Vergne, TN.
Orders shipping to an address other than a confirmed Credit Card / Paypal Billing address may incur and additional processing delay.