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 58/81<br />
INTRODUCTION COMPLEXITY UPPER BOUNDS COMPOSITION LOCALITY LOCALISATION GRIDS GRID-LIKE MINORS LABELLED WEBS<br />
Outline of the Intractability Proof<br />
1. Some simple intractability results<br />
2. Grid-Like Minors<br />
(or: why the excluded grid theorem is useless (in this context))<br />
3. Tree Labelled Webs<br />
4. Intractability of MSO