↓ Skip to main content
Altmetric
What is this page?
Embed badge
Share
Share on Twitter
Share on Facebook
Share by email
Parameterized complexity
Overview of attention for book
Table of Contents
Altmetric Badge
Book Overview
Altmetric Badge
Chapter 1
Computers, Complexity, and Intractability from the Parametric Point of View
Altmetric Badge
Chapter 2
The Basic Definitions
Altmetric Badge
Chapter 3
Some Ad Hoc Methods: The Methods of Bounded Search Tree and Problem Kernel
Altmetric Badge
Chapter 4
Optimization Problems, Approximation Schemes, and Their Relation with FPT
Altmetric Badge
Chapter 5
The Advice View Revisited and LOGSPACE
Altmetric Badge
Chapter 6
Methods via Automata and Bounded Treewidth
Altmetric Badge
Chapter 7
Well-Quasi-Orderings and the Robertson-Seymour Theorems
Altmetric Badge
Chapter 8
Miscellaneous Techniques
Altmetric Badge
Chapter 9
Reductions
Altmetric Badge
Chapter 10
The Basic Class W [1] and an Analog of Cook’s Theorem
Altmetric Badge
Chapter 11
Some Other W [1]-Hardness Results
Altmetric Badge
Chapter 12
The W -Hierarchy
Altmetric Badge
Chapter 13
Beyond W [ t ]-Hardness
Altmetric Badge
Chapter 14
Fixed Parameter Analogs of PSPACE and k -Move Games
Altmetric Badge
Chapter 15
Provable Intractability: The Class X P
Altmetric Badge
Chapter 16
Another Basis for the W -Hierarchy, the Tradeoff-Theorem, and Randomized Reductions
Altmetric Badge
Chapter 17
Relationships with Classical Complexity and Limited Nondeterminism
Altmetric Badge
Chapter 18
The Monotone and Antimonotone Collapse Theorems: MONOTONE W [2 t + 1] = W [2 t ] and ANTIMONOTONE W [2 t + 2] = W [2 t + 1]
Altmetric Badge
Chapter 19
The Structure of Languages Under Parameterized Reducibilities
Overall attention for this book and its chapters
Altmetric Badge
Mentioned by
blogs
1
blog
twitter
2
X users
syllabi
1
institution with syllabi
wikipedia
27
Wikipedia pages
Citations
dimensions_citation
2190
Dimensions
Readers on
mendeley
3
Mendeley
Book overview
1. Computers, Complexity, and Intractability from the Parametric Point of View
2. The Basic Definitions
3. Some Ad Hoc Methods: The Methods of Bounded Search Tree and Problem Kernel
4. Optimization Problems, Approximation Schemes, and Their Relation with FPT
5. The Advice View Revisited and LOGSPACE
6. Methods via Automata and Bounded Treewidth
7. Well-Quasi-Orderings and the Robertson-Seymour Theorems
8. Miscellaneous Techniques
9. Reductions
10. The Basic Class W [1] and an Analog of Cook’s Theorem
11. Some Other W [1]-Hardness Results
12. The W -Hierarchy
13. Beyond W [ t ]-Hardness
14. Fixed Parameter Analogs of PSPACE and k -Move Games
15. Provable Intractability: The Class X P
16. Another Basis for the W -Hierarchy, the Tradeoff-Theorem, and Randomized Reductions
17. Relationships with Classical Complexity and Limited Nondeterminism
18. The Monotone and Antimonotone Collapse Theorems: MONOTONE W [2 t + 1] = W [2 t ] and ANTIMONOTONE W [2 t + 2] = W [2 t + 1]
19. The Structure of Languages Under Parameterized Reducibilities
Summary
Blogs
X
Syllabi
Wikipedia
Dimensions citations
This data is correct as of December 2015 - for more up to date information, please visit
https://opensyllabus.org/
So far, Altmetric has seen this research output assigned in
1
syllabus from an institution on Open Syllabus Project.
Institution
Syllabi count
Course subject areas covered
Georg-August Universität Göttingen
1
Performing Arts