Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
ISBN-13:
9783540299523
ISBN-10:
3540299521
Edition:
2006
Author:
J. Flum, M. Grohe
Publication date:
2006
Publisher:
Springer
Format:
Hardcover
508 pages
Category:
AI & Machine Learning
,
Algorithms
,
Programming
,
Applied
,
Mathematics
,
Computer Science
FREE US shipping
Book details
ISBN-13:
9783540299523
ISBN-10:
3540299521
Edition:
2006
Author:
J. Flum, M. Grohe
Publication date:
2006
Publisher:
Springer
Format:
Hardcover
508 pages
Category:
AI & Machine Learning
,
Algorithms
,
Programming
,
Applied
,
Mathematics
,
Computer Science
Summary
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) (ISBN-13: 9783540299523 and ISBN-10: 3540299521), written by authors
J. Flum, M. Grohe, was published by Springer in 2006.
With an overall rating of 3.6 stars, it's a notable title among other
AI & Machine Learning
(Algorithms, Programming, Applied, Mathematics, Computer Science) books. You can easily purchase or rent Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) (Hardcover) from BooksRun,
along with many other new and used
AI & Machine Learning
books
and textbooks.
And, if you're looking to sell your copy, our current buyback offer is $0.3.
Description
This book is a state-of-the-art introduction into both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes. It presents detailed proofs of recent advanced results that have not appeared in book form before and replaces the earlier publication "Parameterized Complexity" by Downey and Fellows as the definitive book on this subject. The book will interest computer scientists, mathematicians and graduate students engaged with algorithms and problem complexity.
We would LOVE it if you could help us and other readers by reviewing the book
Book review
Congratulations! We have received your book review.
{user}
{createdAt}
by {truncated_author}