1 search results - page 1 / 1 » A 7 8-Approximation Algorithm for MAX 3SAT |
110
click to vote
COCO
2005
Springer
15 years 8 months ago
2005
Springer
We study the complexity of approximating Max NME3SAT, a variant of Max 3SAT when the instances are guaranteed to not have any mixed clauses, i.e., every clause has either all its ...