Parameterized Complexity

Parameterized Complexity Of Representing Models Of MSO Formulas

This paper extends Courcelle's theorem by showing that models of MSO2 formulas with free variables can be represented with decision diagrams whose size is parameterized linearly. It establishes parameterized linear upper bounds for sentential decision diagrams (SDD) based on treewidth and ordered binary decision diagrams (OBDD) based on pathwidth.