On the hardness of approximating max-satisfy (Q1045886)
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: On the hardness of approximating max-satisfy |
scientific article; zbMATH DE number 5650167
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the hardness of approximating max-satisfy |
scientific article; zbMATH DE number 5650167 |
Statements
On the hardness of approximating max-satisfy (English)
0 references
18 December 2009
0 references
approximation algorithms
0 references
computational complexity
0 references
0 references
0 references
0.9579066
0 references
0 references
0 references
0.9299607
0 references
0.9193779
0 references
