Parameterized Complexity Theory
- Indbinding:
- Paperback
- Sideantal:
- 512
- Udgivet:
- 12. februar 2010
- Størrelse:
- 155x28x235 mm.
- Vægt:
- 768 g.
- 8-11 hverdage.
- 27. november 2024
På lager
Normalpris
Abonnementspris
- Rabat på køb af fysiske bøger
- 1 valgfrit digitalt ugeblad
- 20 timers lytning og læsning
- Adgang til 70.000+ titler
- Ingen binding
Abonnementet koster 75 kr./md.
Ingen binding og kan opsiges når som helst.
- 1 valgfrit digitalt ugeblad
- 20 timers lytning og læsning
- Adgang til 70.000+ titler
- Ingen binding
Abonnementet koster 75 kr./md.
Ingen binding og kan opsiges når som helst.
Beskrivelse af Parameterized Complexity Theory
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.
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.
Brugerbedømmelser af Parameterized Complexity Theory
Giv din bedømmelse
For at bedømme denne bog, skal du være logget ind.Andre købte også..
Find lignende bøger
Bogen Parameterized Complexity Theory findes i følgende kategorier:
- Business og læring > Computer og IT
- Matematik og naturvidenskab > Matematik > Matematikkens fundament > Matematisk logik
- Databehandling og informationsteknologi > Programmering / softwareudvikling > Algoritmer og datastrukturer
- Databehandling og informationsteknologi > Informatik > Matematisk datateori
- Databehandling og informationsteknologi > Informatik > Systemanalyse og systemdesign
© 2024 Pling BØGER Registered company number: DK43351621