MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time (Q5756576)
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: MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in \mathcal{O}(2ⁿ) Time |
scientific article; zbMATH DE number 5187235
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time |
scientific article; zbMATH DE number 5187235 |
Statements
MAX-SAT for Formulas with Constant Clause Density Can Be Solved Faster Than in $\mathcal{O}(2^n)$ Time (English)
0 references
4 September 2007
0 references
0.8739838004112244
0 references
0.8540587425231934
0 references
0.8507030606269836
0 references
