@inproceedings{3d1311fb8f774097b2cc209964a89f77,

title = "A new upper bound for 3-SAT",

abstract = "We show that a randomly chosen 3-CNF formula over n variables with clauses-to-variables ratio at least 4.4898 is asymptotically almost surely unsatisfiable. The previous best such bound, due to Dubois in 1999, was 4.506. The first such bound, independently discovered by many groups of researchers since 1983, was 5.19. Several decreasing values between 5.19 and 4.506 were published in the years between. The probabilistic techniques we use for the proof are, we believe, of independent interest.",

keywords = "3-SAT, Random, Satisfiability, Threshold",

author = "J. D{\'i}az and L. Kirousis and D. Mitsche and X. P{\'e}rez-Gimenez",

year = "2008",

language = "English (US)",

isbn = "9783939897088",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

pages = "163--174",

booktitle = "FSTTCS 2008 - IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science",

note = "28th International Conference on the Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2008 ; Conference date: 09-12-2008 Through 11-12-2008",

}