Proves fine-grained nearly ETH-tight bounds for Courcelle's theorem depending on treewidth t and the number of first-order and second-order variables in each quantifier alternation block of the MSO formula.
On the Parameterised Intractability of Monadic Second-Order Logic , booktitle =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Fine-Grained Bounds for Courcelle's Theorem
Proves fine-grained nearly ETH-tight bounds for Courcelle's theorem depending on treewidth t and the number of first-order and second-order variables in each quantifier alternation block of the MSO formula.