Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063)
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: Exploiting subproblem optimization in SAT-based maxsat algorithms |
scientific article; zbMATH DE number 6708748
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exploiting subproblem optimization in SAT-based maxsat algorithms |
scientific article; zbMATH DE number 6708748 |
Statements
Exploiting subproblem optimization in SAT-based maxsat algorithms (English)
0 references
28 April 2017
0 references
constraint optimization
0 references
satisfiability
0 references
maximum satisfiability
0 references
0 references
0.8443906903266907
0 references
0.8396270871162415
0 references
0.8232666254043579
0 references
0.8037329912185669
0 references
