Pages that link to "Item:Q2904773"
From MaRDI portal
The following pages link to Lower bounds on the complexity of \(\mathrm{MSO}_1\) model-checking (Q2904773):
Displaying 5 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)
- The complexity of first-order and monadic second-order logic revisited (Q1886318) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- On the parameterized intractability of monadic second-order logic (Q2881095) (← links)