On The Hardness of Approximating Max-Satisfy

Uriel Feige, Daniel Reichman. On The Hardness of Approximating Max-Satisfy. Electronic Colloquium on Computational Complexity (ECCC), (119), 2004. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.