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
711
search results - page 143 / 143
»
Amalgams of Constraint Satisfaction Problems
Sort
relevance
views
votes
recent
update
View
thumb
title
32
click to vote
FOCS
2004
IEEE
126
views
Theoretical Computer Science
»
more
FOCS 2004
»
Optimal Inapproximability Results for Max-Cut and Other 2-Variable CSPs?
14 years 2 months ago
Download
www.cs.cmu.edu
In this paper we show a reduction from the Unique Games problem to the problem of approximating MAX-CUT to within a factor of GW + , for all > 0; here GW .878567 denotes the a...
Subhash Khot, Guy Kindler, Elchanan Mossel, Ryan O...
claim paper
Read More »
« Prev
« First
page 143 / 143
Last »
Next »