Analysis and solving SAT and MAX-SAT problems using an \(L\)-partition approach (Q367248)
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: Analysis and solving SAT and MAX-SAT problems using an L-partition approach |
scientific article; zbMATH DE number 6211890
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Analysis and solving SAT and MAX-SAT problems using an \(L\)-partition approach |
scientific article; zbMATH DE number 6211890 |
Statements
Analysis and solving SAT and MAX-SAT problems using an \(L\)-partition approach (English)
0 references
26 September 2013
0 references
satisfiability problem
0 references
integer linear programming
0 references
\(L\)-partition approach
0 references
\(L\)-class enumeration
0 references
0.8614345192909241
0 references
0.7437987327575684
0 references
0.741433322429657
0 references
0.7402647733688354
0 references
