Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction (Q3192053)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction |
scientific article |
Statements
Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction (English)
0 references
26 September 2014
0 references
exponential time algorithm
0 references
polynomial space
0 references
weight
0 references
hard constraint
0 references
counting
0 references
