Carte Parameterized Complexity Theory Jörg Flum

Parameterized Complexity Theory

Limbă: engleză
Legare: Copertă tare
Disponibilitate: În depozitul extern
Expediem în 10-13 zile
649.84 lei
Parameterized complexity theory is a recent branch of computational complexity theory that provides...

Informații despre carte

Limbă
engleză
Legare
Carte - Copertă tare
Publicat
2006
Pagini
495
EAN
9783540299523
ISBN
3540299521
Enbook ID
01561383
Greutate
980
Dimensiuni
155 x 235 x 33

Descriere completă

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.

S-ar putea să te intereseze

773.92 lei
64.41 lei
84.43 lei

Robert Graves

George Stade
98.99 lei

Amish Enterprise

Donald B. Kraybill
355.86 lei
82.92 lei

Cradle of America

Peter Wallenstein
217.92 lei

Computer Science

Ricardo Baeza-Yates
499.97 lei

Allegiance in Exile

David R George III
61.47 lei

Clienții care au cumpărat această carte au mai cumpărat și

58.95 lei

Ábaco : diarios

Francisco León
97.07 lei
81.50 lei