{
  "id": "0804.0362",
  "version": "v2",
  "published": "2008-04-02T14:32:44.000Z",
  "updated": "2008-04-14T09:31:46.000Z",
  "title": "Exhaustive enumeration unveils clustering and freezing in random 3-SAT",
  "authors": [
    "John Ardelius",
    "Lenka Zdeborová"
  ],
  "comment": "4 pages, 3 figures",
  "journal": "Phys. Rev. E 78, 040101(R) (2008)",
  "doi": "10.1103/PhysRevE.78.040101",
  "categories": [
    "cond-mat.stat-mech",
    "cond-mat.dis-nn",
    "cs.CC",
    "cs.DS"
  ],
  "abstract": "We study geometrical properties of the complete set of solutions of the random 3-satisfiability problem. We show that even for moderate system sizes the number of clusters corresponds surprisingly well with the theoretic asymptotic prediction. We locate the freezing transition in the space of solutions which has been conjectured to be relevant in explaining the onset of computational hardness in random constraint satisfaction problems.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2008-04-14T09:31:46.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05.40.-a",
      "89.20.Ff",
      "75.10.Nr",
      "89.70.Eg"
    ],
    "keywords": [
      "exhaustive enumeration unveils clustering",
      "random constraint satisfaction problems",
      "moderate system sizes",
      "theoretic asymptotic prediction",
      "complete set"
    ],
    "tags": [
      "journal article"
    ],
    "publication": {
      "publisher": "APS",
      "journal": "Physical Review E",
      "year": 2008,
      "month": "Oct",
      "volume": 78,
      "number": 4,
      "pages": "040101"
    },
    "note": {
      "typesetting": "TeX",
      "pages": 4,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2008PhRvE..78d0101A"
    }
  }
}