Pages that link to "Item:Q3644759"
From MaRDI portal
The following pages link to On the Parameterised Intractability of Monadic Second-Order Logic (Q3644759):
Displaying 8 items.
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking (Q395003) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Computability by monadic second-order logic (Q2656341) (← 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)
- Bisimulation Invariant Monadic-Second Order Logic in the Finite (Q5002802) (← links)
- Directed Nowhere Dense Classes of Graphs (Q5417630) (← links)
- MSO undecidability for hereditary classes of unbounded clique-width (Q6614399) (← links)