Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking (Q395003)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking |
scientific article; zbMATH DE number 6251117
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking |
scientific article; zbMATH DE number 6251117 |
Statements
Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking (English)
0 references
28 January 2014
0 references
graph MSO logic
0 references
tree-width
0 references
digraph width
0 references
intractability
0 references
0.99978536
0 references
0.88420856
0 references
0.8754319
0 references
0.8726532
0 references
0.87263745
0 references
0.87180865
0 references
0 references
