Searching for "Algorithmic Meta-theorems." – sorted by Relevance.
-
Model theory makes formulas large
- and complexity [10, 6, 17, 18]. In particular, there are very general algorithmic meta-theorems stating
- Cited by 1 (1 self) – Add To MetaCart
-
Clique-width: On the Price of Generality ∗
- that some of the algorithmic meta-theorems for treewidth can be carried over to graphs of bounded clique
- Add To MetaCart
-
Contributions to Parameterized Complexity
- . . . . . . . . . . . . . . 18 2.2.3 Dynamic programming on tree decompositions . . . . . . . . . 21 2.3 Algorithmic meta-theorems
- Cited by 4 (3 self) – Add To MetaCart
-
Approximation schemes for firstorder definable optimisation problems
- , for example, to monadic second-order logic (cf. Example 11). We see our result as an algorithmic meta theorem
- Cited by 5 (5 self) – Add To MetaCart

