Kniha Parameterized Complexity Theory Jörg Flum

Parameterized Complexity Theory

Jazyk: Angličtina
Vazba: Pevná
Dostupnost: Skladem u dodavatele
Odesíláme za 10-13 dnů
2 679
Parameterized complexity theory is a recent branch of computational complexity theory that provides...

Informace o knize

Jazyk
Angličtina
Vazba
Kniha - Pevná
Vydáno
2006
Stránek
495
EAN
9783540299523
ISBN
3540299521
Enbook ID
01561383
Hmotnost
980
Rozměry
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 zajímat

3 198
241
351

Robert Graves

George Stade
649

Amish Enterprise

Donald B. Kraybill
1 567
347

Cradle of America

Peter Wallenstein
919

Computer Science

Ricardo Baeza-Yates
2 187

Allegiance in Exile

David R George III
204

Zákaznicí kteří koupili tuto knihu koupili také

Ábaco : diarios

Francisco León
447
331