تفاصيل الكتاب

978-3-540-29953-0

Parameterized Complexity Theory

Publish Date: 2006

ISBN: 978-3-540-29953-0

Internet Resource: Please Login to download book


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.


Subject: Computer Science, Algorithms, Automat, algorithm, automata, complexity, complexity theory, computer, logic, programming