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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
110
click to vote
SODA
2003
ACM
125
views
Algorithms
»
more
SODA 2003
»
Random MAX SAT, random MAX CUT, and their phase transitions
15 years 4 months ago
Download
www-math.mit.edu
With random inputs, certain decision problems undergo a “phase transition”. We prove similar behavior in an optimization context. Given a conjunctive normal form (CNF) formula...
Don Coppersmith, David Gamarnik, Mohammad Taghi Ha...
claim paper
Read More »