Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695)
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 sparse instances of Max SAT via width reduction and greedy restriction |
scientific article; zbMATH DE number 6536611
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving sparse instances of Max SAT via width reduction and greedy restriction |
scientific article; zbMATH DE number 6536611 |
Statements
Solving sparse instances of Max SAT via width reduction and greedy restriction (English)
0 references
28 January 2016
0 references
exponential time algorithm
0 references
polynomial space
0 references
weight
0 references
hard constraint
0 references
counting
0 references
0 references
0 references
0 references
1.0000001
0 references
0.91469896
0 references
0.91469896
0 references
0.8918959
0 references
0.8867411
0 references
0 references
0.8811648
0 references
0.87857604
0 references
