Lower bounds on the complexity of \(\mathrm{MSO}_1\) model-checking (Q2904773)
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 MSO₁ model-checking |
scientific article; zbMATH DE number 6070913
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lower bounds on the complexity of \(\mathrm{MSO}_1\) model-checking |
scientific article; zbMATH DE number 6070913 |
Statements
23 August 2012
0 references
monadic second-order logic
0 references
treewidth
0 references
lower bounds
0 references
exponential time hypothesis
0 references
parameterized complexity
0 references
Lower bounds on the complexity of \(\mathrm{MSO}_1\) model-checking (English)
0 references
0.9519140720367432
0 references
0.8579360246658325
0 references
0.8573358058929443
0 references
0.83128422498703
0 references
0.8301465511322021
0 references
