Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) by J. Flum (PDF)

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.

User’s Reviews

Editorial Reviews: Review 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)

Reviews from Amazon users which were colected at the time this book was published on the website:

⭐Left corner of the book was broken. That’s why I chose to return it.

⭐

Keywords

Free Download Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) in PDF format
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) PDF Free Download
Download Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) 2006 PDF Free
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) 2006 PDF Free Download
Download Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) PDF
Free Download Ebook Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)