Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings (Q5505579)
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: Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings |
scientific article; zbMATH DE number 5498365
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings |
scientific article; zbMATH DE number 5498365 |
Statements
Treewidth: A Useful Marker of Empirical Hardness in Quantified Boolean Logic Encodings (English)
0 references
27 January 2009
0 references
0.895560622215271
0 references
0.803695023059845
0 references
0.7984941005706787
0 references
0.7802900075912476
0 references
0.7766303420066833
0 references
