Solving Sparse Instances of Max SAT via Width Reduction and Greedy Restriction (Q3192053): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-319-09284-3_4 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1567941403 / rank | |||
Normal rank | |||
Latest revision as of 19:17, 19 March 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
