Can you beat treewidth? (Q3002818)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5899291
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Can you beat treewidth? |
scientific article; zbMATH DE number 5899291 |
Statements
24 May 2011
0 references
constraint satisfaction
0 references
treewidth
0 references
exponential time hypothesis
0 references
0.8481898307800293
0 references
0.8312472105026245
0 references
0.8216132521629333
0 references
0.8062255382537842
0 references
