Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction (Q3192053): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 23:02, 3 February 2024
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
