Pages that link to "Item:Q2881095"
From MaRDI portal
The following pages link to On the parameterized intractability of monadic second-order logic (Q2881095):
Displaying 13 items.
- On the model-checking of monadic second-order formulas with edge set quantifications (Q415286) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Tree-width and the monadic quantifier hierarchy. (Q1401360) (← links)
- The complexity of first-order and monadic second-order logic revisited (Q1886318) (← links)
- Computability by monadic second-order logic (Q2656341) (← links)
- Lower bounds on the complexity of \(\mathrm{MSO}_1\) model-checking (Q2904773) (← links)
- Special tree-width and the verification of monadic second-order graph properties (Q2908834) (← links)
- Parameters Tied to Treewidth (Q2978180) (← links)
- Parameterized Complexity Results for 1-safe Petri Nets (Q3090841) (← links)
- SAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability (Q3638278) (← links)
- (Q3824397) (← links)
- Bisimulation Invariant Monadic-Second Order Logic in the Finite (Q5002802) (← links)
- Directed Nowhere Dense Classes of Graphs (Q5417630) (← links)