Improved exact algorithms for mildly sparse instances of MAX SAT (Q5363763)
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: Improved exact algorithms for mildly sparse instances of MAX SAT |
scientific article; zbMATH DE number 6784961
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved exact algorithms for mildly sparse instances of MAX SAT |
scientific article; zbMATH DE number 6784961 |
Statements
29 September 2017
0 references
maximum satisfiability
0 references
weighted
0 references
polynomial space
0 references
exponential space
0 references
Improved Exact Algorithms for Mildly Sparse Instances of Max SAT (English)
0 references
0.9974592924118042
0 references
0.8968196511268616
0 references
0.8935366272926331
0 references
0.8927541971206665
0 references
