Książka Parameterized Complexity Theory Jörg Flum

Parameterized Complexity Theory

Język: Angielski
Oprawa: Twarda
Dostępność: Dostępna u dostawcy
Wysyłamy za 10-13 dni
497.25
Parameterized complexity theory is a recent branch of computational complexity theory that provides...

Informacje o książce

Język
Angielski
Oprawa
Książka - Twarda
Data wydania
2006
strony
495
EAN
9783540299523
ISBN
3540299521
Enbook ID
01561383
Waga
980
Wymiary
155 x 235 x 33

Pełny opis

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.

Możesz być zainteresowany

592.82
48.80
64.78

Robert Graves

George Stade
76.67

Amish Enterprise

Donald B. Kraybill
287.20
63.90

Cradle of America

Peter Wallenstein
168.54

Computer Science

Ricardo Baeza-Yates
383.46

Allegiance in Exile

David R George III
46.95

Klienci, którzy kupili tę książkę, kupili również

45.10

Ábaco : diarios

Francisco León
78.42
61.85