ISBN10: 3540299521, ISBN13: 9783540299523, [publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. K] Hardcover Ancien livre de bibliothèque. Edition 2006. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Edition 2006. Ammareal gives back up to 15% of this item's net price to charity organizations.
[Morangis, France] [Publication Year: 2006]

Springer-Verlag Berlin and Heidelberg GmbH & Co. K, Date: 2006. Hardcover. Very Good. Former library book. Edition 2006. Ammareal gives back up to 15% of this item's net price to charity organizations. 2006. Springer-Verlag Berlin and Heidelberg GmbH & Co. K ISBN 3540299521 9783540299523 [FR]

Berlin: Springer, Date: 2006. Gebunden Bibliotheksexemplar gut erhalten 2006. Springer ISBN 3540299521 9783540299523 [DE]

ISBN10: 3540299521, ISBN13: 9783540299523, [publisher: Springer, Berlin] Hardcover Bibliotheksexemplar gut erhalten, Mathematik, 404 S
[Bonn, NRW, Germany] [Publication Year: 2006]

ISBN10: 3540299521, ISBN13: 9783540299523, [publisher: Springer Berlin Heidelberg] Hardcover Druck auf Anfrage Neuware - Printed after ordering - 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.
[Einbeck, Germany] [Publication Year: 2006]
+ description size: -