Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

167

Voted

FOCS
1997
IEEE

112views Theoretical Computer Science» more FOCS 1997»

A 7/8-Approximation Algorithm for MAX 3SAT?

15 years 10 months ago

A 7/8-Approximation Algorithm for MAX 3SAT?

Download www.cse.buffalo.edu

Howard J. Karloff, Uri Zwick

Real-time Traffic

FOCS 1997 | Theoretical Computer Science |

claim paper

Related Content

» Hardness of Max 3SAT with No Mixed Clauses

» MAX3SAT is exponentially hard to approximate if NP has positive dimension

» On the Hardness and Easiness of Random 4SAT Formulas

» Improved nonapproximability results

» Exact Max 2Sat Easier and Faster

» Relaxed Survey Propagation A SumProduct Algorithm for MaxSAT

» Sums of squares based approximation algorithms for MAXSAT

» Iterated Robust Tabu Search for MAXSAT

» Free Bits PCPs and NonApproximability Towards Tight Results

Post Info
More Details (n/a)

Added	06 Aug 2010
Updated	06 Aug 2010
Type	Conference
Year	1997
Where	FOCS
Authors	Howard J. Karloff, Uri Zwick

Comments (0)