Solving <i>d-</i>SAT via Backdoors to Small Treewidth (Q5363089)
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: Solving d-SAT via Backdoors to Small Treewidth |
scientific article; zbMATH DE number 6786404
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving <i>d-</i>SAT via Backdoors to Small Treewidth |
scientific article; zbMATH DE number 6786404 |
Statements
Solving <i>d-</i>SAT via Backdoors to Small Treewidth (English)
0 references
5 October 2017
0 references
0 references
0.88715065
0 references
0.86918724
0 references
0.86326855
0 references
0.8618417
0 references
0.86166525
0 references
0.8605827
0 references
