Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
41
click to vote
FOCS
1997
IEEE
favorite
Email
discuss
report
112
views
Theoretical Computer Science
»
more
FOCS 1997
»
A 7/8-Approximation Algorithm for MAX 3SAT?
14 years 3 months ago
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
more »
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)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision