Beskrivning
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.
Bokdetaljer
Format
Pocketbok
Sidor
508 sidor
Språk
Engelska
Publicerad
Feb 12, 2010
Förlag
Springer
Upplagor
2 editions
ISBN-10
3642067573
ISBN-13
9783642067570