{
  "id": "math/0310193",
  "version": "v2",
  "published": "2003-10-13T20:30:49.000Z",
  "updated": "2003-10-22T01:45:07.000Z",
  "title": "The Satisfiability Threshold of Random 3-SAT Is at Least 3.52",
  "authors": [
    "MohammadTaghi Hajiaghayi",
    "Gregory B. Sorkin"
  ],
  "categories": [
    "math.CO",
    "cs.DM",
    "math.PR"
  ],
  "abstract": "We prove that a random 3-SAT instance with clause-to-variable density less than 3.52 is satisfiable with high probability. The proof comes through an algorithm which selects (and sets) a variable depending on its degree and that of its complement.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2003-10-22T01:45:07.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "satisfiability threshold",
      "high probability",
      "proof comes",
      "complement"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2003math.....10193H"
    }
  }
}