Könyv Parameterized Complexity Theory Jörg Flum

Parameterized Complexity Theory

Nyelv: Angol
Kötés: Kemény kötésű
Elérhetőség: Beszállítói készleten
Küldés 10-13 napon belül
45 254 Ft
Parameterized complexity theory is a recent branch of computational complexity theory that provides...

Információk a könyvről

Nyelv
Angol
Kötés
Könyv - Kemény kötésű
Kiadva
2006
oldal
495
EAN
9783540299523
ISBN
3540299521
Enbook ID
01561383
Súly
980
Méretek
155 x 235 x 33

Teljes leírás

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.

Érdekelheti

53 852 Ft
4 349 Ft
5 855 Ft

Robert Graves

George Stade
6 837 Ft

Amish Enterprise

Donald B. Kraybill
24 667 Ft
5 756 Ft

Cradle of America

Peter Wallenstein
15 086 Ft

Computer Science

Ricardo Baeza-Yates
35 444 Ft

Allegiance in Exile

David R George III
4 308 Ft

Azok a vásárlók, akik ezt a könyvet megvásárolták, a következőket is megvásárolták

Ábaco : diarios

Francisco León
6 554 Ft
5 685 Ft