<?xml version="1.0"?>
<dblp>
<article key="journals/eccc/ECCC-TR04-119" mdate="2006-06-30">
<author>Uriel Feige</author>
<author>Daniel Reichman</author>
<title>On The Hardness of Approximating Max-Satisfy</title>
<journal>Electronic Colloquium on Computational Complexity (ECCC)</journal>
<year>2004</year>
<number>119</number>
<url>db/journals/eccc/eccc11.html#TR04-119</url>
<ee>http://eccc.hpi-web.de/eccc-reports/2004/TR04-119/index.html</ee>
</article>
</dblp>
