Beating brute force for (quantified) satisfiability of circuits of bounded treewidth (Q4607895)
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: Beating brute force for (quantified) satisfiability of circuits of bounded treewidth |
scientific article; zbMATH DE number 6850326
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Beating brute force for (quantified) satisfiability of circuits of bounded treewidth |
scientific article; zbMATH DE number 6850326 |
Statements
15 March 2018
0 references
0.7815119028091431
0 references
0.781309187412262
0 references
0.7796441316604614
0 references
0.7773714065551758
0 references
