The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Which problems have strongly exponential complexity?
Journal of Computer and System Sciences
Theoretical Computer Science - Australasian computer science
Tree-width and the monadic quantifier hierarchy
Theoretical Computer Science - Logic and complexity in computer science
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Clique-width: on the price of generality
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On the parameterised intractability of monadic second-order logic
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
On brambles, grid-like minors, and parameterized intractability of monadic second-order logic
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Algorithmic lower bounds for problems parameterized by clique-width
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Lower Bounds for the Complexity of Monadic Second-Order Logic
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
Robust simulations and significant separations
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Polynomial treewidth forces a large grid-like-minor
European Journal of Combinatorics
Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach
Graph Structure and Monadic Second-Order Logic: A Language-Theoretic Approach
| Hi-index | 0.00 |
Kreutzer and Tazari proved in 2010 that MSO"2 model-checking is not polynomial (XP) w.r.t. the formula size as parameter for graph classes that are subgraph-closed and whose tree-width is poly-logarithmically unbounded. We prove that MSO"1 model-checking with a fixed set of vertex labels - i.e., without edge-set quantification - is not solvable even in quasi-polynomial time for fixed MSO"1-formulas in such graph classes. Both the lower bounds hold modulo a certain complexity-theoretic assumption, namely, the Exponential-Time Hypothesis (ETH) in the former case and the non-uniform ETH in the latter case. In comparison to Kreutzer and Tazari, we show a different set of problems to be intractable, and our stronger complexity assumption of non-uniform ETH slightly weakens assumptions on the graph class and greatly simplifies important lengthy parts of the former proof. Our result also has an interesting consequence in the realm of digraph width measures.