Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking (Q395003): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3077955 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong edge-coloring of graphs with maximum degree 4 using 22 colors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformly hard languages. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255575 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4633895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust simulations and significant separations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are There Any Good Digraph Width Measures? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3086928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Parameterised Intractability of Monadic Second-Order Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3172385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed Nowhere Dense Classes of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-width and the monadic quantifier hierarchy. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial treewidth forces a large grid-like-minor / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank

Revision as of 06:36, 7 July 2024

scientific article
Language Label Description Also known as
English
Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking
scientific article

    Statements

    Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    28 January 2014
    0 references
    graph MSO logic
    0 references
    tree-width
    0 references
    digraph width
    0 references
    intractability
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references