Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6781970
| 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 6781970 |
Statements
Improved exact algorithms for mildly sparse instances of MAX SAT (English)
0 references
28 September 2017
0 references
maximum satisfiability
0 references
weighted
0 references
polynomial space
0 references
exponential space
0 references
0 references
0 references
0 references
0 references
0.9974592924118042
0 references
0.9005851149559021
0 references
0.897236168384552
0 references
0.8967134952545166
0 references
