Pages that link to "Item:Q1886318"
From MaRDI portal
The following pages link to The complexity of first-order and monadic second-order logic revisited (Q1886318):
Displayed 22 items.
- Courcelle's theorem -- a game-theoretic approach (Q408375) (← links)
- Model-checking hierarchical structures (Q414908) (← links)
- On the model-checking of monadic second-order formulas with edge set quantifications (Q415286) (← links)
- An optimal construction of Hanf sentences (Q420856) (← links)
- Lower bounds for kernelizations and other preprocessing procedures (Q538466) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- Linear delay enumeration and monadic second-order logic (Q967312) (← links)
- \(H\)-join decomposable graphs and algorithms with runtime single exponential in rankwidth (Q972341) (← links)
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- Algorithmic meta-theorems for restrictions of treewidth (Q1759681) (← links)
- Parameterized modal satisfiability (Q1759682) (← links)
- Automata for the verification of monadic second-order graph properties (Q1948277) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- Bounded fixed-parameter tractability and reducibility (Q2382273) (← links)
- Counting truth assignments of formulas of bounded tree-width or clique-width (Q2473047) (← links)
- The recognizability of sets of graphs is a robust property (Q2566292) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Lower Bounds for Kernelizations and Other Preprocessing Procedures (Q3576044) (← links)
- Comparing the succinctness of monadic query languages over finite trees (Q4659888) (← links)
- Inductive computations on graphs defined by clique-width expressions (Q5321781) (← links)
- Linear Recurrence Relations for Graph Polynomials (Q5452182) (← links)
