Parameterized Complexity Theory

J. Flum · M. Grohe

mai 2006 · Springer Science & Business Media

E-bok

495

Sider

Vurderinger og anmeldelser blir ikke kontrollert Finn ut mer

Om denne e-boken

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.

Vurder denne e-boken

Fortell oss hva du mener.

Hvordan lese innhold

Smarttelefoner og nettbrett

Installer Google Play Bøker-appen for Android og iPad/iPhone. Den synkroniseres automatisk med kontoen din og lar deg lese både med og uten nett – uansett hvor du er.

Datamaskiner

Du kan lytte til lydbøker du har kjøpt på Google Play, i nettleseren på datamaskinen din.

Lesebrett og andre enheter

For å lese på lesebrett som Kobo eReader må du laste ned en fil og overføre den til enheten din. Følg den detaljerte veiledningen i brukerstøtten for å overføre filene til støttede lesebrett.

Rapporter ulovlig innhold