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
138
click to vote
FOCS
2006
IEEE
134
views
Theoretical Computer Science
»
more
FOCS 2006
»
Witnesses for non-satisfiability of dense random 3CNF formulas
15 years 7 months ago
Download
research.microsoft.com
We consider random 3CNF formulas with n variables and m clauses. It is well known that when m > cn (for a sufficiently large constant c), most formulas are not satisfiable. How...
Uriel Feige, Jeong Han Kim, Eran Ofek
claim paper
Read More »