Best possible approximation algorithm for MAX SAT with cardinality constraint. (Q5945919)
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 1657886
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Best possible approximation algorithm for MAX SAT with cardinality constraint. |
scientific article; zbMATH DE number 1657886 |
Statements
Best possible approximation algorithm for MAX SAT with cardinality constraint. (English)
0 references
9 January 2002
0 references
0.8615561127662659
0 references
