Kniha Parameterized Complexity Theory Jörg Flum

Parameterized Complexity Theory

Jazyk: Angličtina
Väzba: Pevná
Dostupnosť: Skladom u dodávateľa
Odosielame za 10-13 dní
117.27
Parameterized complexity theory is a recent branch of computational complexity theory that provides...

Informácie o knihe

Jazyk
Angličtina
Väzba
Kniha - Pevná
Vydalo
2006
Stránok
495
EAN
9783540299523
ISBN
3540299521
Enbook ID
01561383
Hmotnosť
980
Rozmery
155 x 235 x 33

Kompletný popis

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.

Mohlo by vás zaujímať

139.75
10.69
14.52

Robert Graves

George Stade
17.36

Amish Enterprise

Donald B. Kraybill
64.76
14.32

Cradle of America

Peter Wallenstein
37.97

Computer Science

Ricardo Baeza-Yates
95.19

Allegiance in Exile

David R George III
11.08

Zákazníci, ktorí si kúpili túto knihu, kúpili tiež

10.59

Ábaco : diarios

Francisco León
18.44
13.63