Introducing RcppDynProg
R-bloggers,
(This article was first published on R – Win-Vector Blog, and kindly contributed to R-bloggers) RcppDynProg is a new…
Parameterized complexity
Overview of attention for book
Table of Contents
-
Altmetric BadgeBook Overview
-
Altmetric BadgeChapter 1 Computers, Complexity, and Intractability from the Parametric Point of View
-
Altmetric BadgeChapter 2 The Basic Definitions
-
Altmetric BadgeChapter 3 Some Ad Hoc Methods: The Methods of Bounded Search Tree and Problem Kernel
-
Altmetric BadgeChapter 4 Optimization Problems, Approximation Schemes, and Their Relation with FPT
-
Altmetric BadgeChapter 5 The Advice View Revisited and LOGSPACE
-
Altmetric BadgeChapter 6 Methods via Automata and Bounded Treewidth
-
Altmetric BadgeChapter 7 Well-Quasi-Orderings and the Robertson-Seymour Theorems
-
Altmetric BadgeChapter 8 Miscellaneous Techniques
-
Altmetric BadgeChapter 9 Reductions
-
Altmetric BadgeChapter 10 The Basic Class W [1] and an Analog of Cook’s Theorem
-
Altmetric BadgeChapter 11 Some Other W [1]-Hardness Results
-
Altmetric BadgeChapter 12 The W -Hierarchy
-
Altmetric BadgeChapter 13 Beyond W [ t ]-Hardness
-
Altmetric BadgeChapter 14 Fixed Parameter Analogs of PSPACE and k -Move Games
-
Altmetric BadgeChapter 15 Provable Intractability: The Class X P
-
Altmetric BadgeChapter 16 Another Basis for the W -Hierarchy, the Tradeoff-Theorem, and Randomized Reductions
-
Altmetric BadgeChapter 17 Relationships with Classical Complexity and Limited Nondeterminism
-
Altmetric BadgeChapter 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 BadgeChapter 19 The Structure of Languages Under Parameterized Reducibilities
Altmetric Badge
Mentioned by
- syllabi
- 1 institution with syllabi
- wikipedia
- 27 Wikipedia pages
Citations
- dimensions_citation
- 2190 Dimensions
Readers on
- mendeley
- 3 Mendeley