Flum, Jörg
Parameterized Complexity Theory
Table of contents
1. Fixed-Parameter Tractability
2. Reductions and Parameterized Intractability
3. The Class W[P]
4. Logic and Complexity
5. Two Fundamental Hierarchies
6. The First Level of the Hierarchies
7. The W-Hierarchy
8. The A-Hierarchy
9. Kernelization and Linear Programming Techniques
10. The Automata-Theoretic Approach
11. Tree Width
12. Planarity and Bounded Local Tree Width
13. Homomorphisms and Embeddings
14. Parameterized Counting Problems
15. Bounded Fixed-Parameter Tractability and Limited Nondeterminism
16. Subexponential Fixed-Parameter Tractability
DRM-restrictions
Printing: not available
Clipboard copying: not available
Avainsanat: COMPUTERS / Computer Science COM014000
- Tekijä(t)
- Flum, Jörg
- Grohe, Martin
- Julkaisija
- Springer
- Julkaisuvuosi
- 2006
- Kieli
- en
- Painos
- 1
- Kategoria
- Tietotekniikka, tietoliikenne
- Tiedostomuoto
- E-kirja
- eISBN (PDF)
- 9783540299530
