Uriel Feige, Daniel Reichman. On The Hardness of Approximating Max-Satisfy. Electronic Colloquium on Computational Complexity (ECCC), (119), 2004. [doi]
@article{ECCC-TR04-119,
title = {On The Hardness of Approximating Max-Satisfy},
author = {Uriel Feige and Daniel Reichman},
year = {2004},
url = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-119/index.html},
researchr = {https://researchr.org/publication/ECCC-TR04-119},
cites = {0},
citedby = {0},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
number = {119},
}