Slides.
Slides.
Slides.
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
STEPHAN KREUTZER COMPLEXITY OF MODEL-CHECKING PROBLEMS 53/81<br />
INTRODUCTION COMPLEXITY UPPER BOUNDS COMPOSITION LOCALITY LOCALISATION GRIDS GRID-LIKE MINORS LABELLED WEBS<br />
Lower Bounds for Monadic Second-Order Logic<br />
We would like to show. If a class C of graphs has unbounded tree-width then<br />
MC(MSO 2 ,C) is not fixed-parameter tractable.<br />
Sadly, in this generality this is not true.<br />
Theorem. (Makowsky, Mariño 04)<br />
There are classes C of graphs of unbounded tree-width on which<br />
MC(MSO 2 ,C) is tractable.<br />
But something similar is true.<br />
Unbounded Tree-Width.<br />
We first need to classify the unboundedness of tree-width.