Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series) - Tapa dura

Libro 22 de 45: Texts in Theoretical Computer Science. An EATCS

Flum, J.; Grohe, M.

 
9783540299523: Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Tapa dura
ISBN 10: 3540299521 ISBN 13: 9783540299523
Editorial: Springer, 2006

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

Críticas

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)

Reseña del editor

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
Springer
Año de publicación
2006
Idioma
Inglés
ISBN 10 
3540299521
ISBN 13 
9783540299523
Encuadernación
Tapa dura
Número de páginas
512
Contacto del fabricante
no disponible
Persona responsable
CMN Printpool Inh. Mathis Neumann
https://www.also.com/ec/cms5/en_6000/6000/index.jsp

Friedrich-Karl-Str. 9
Hamburg
Alemania

Otras ediciones populares con el mismo título

9783642067570: Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Edición Destacada

ISBN 10:  3642067573 ISBN 13:  9783642067570
Editorial: Springer, 2010
Tapa blanda