DOI: 10.1016/s0166-218x(99)00034-7. A remark on random 2-SAT

A remark on random 2-SAT

10.1016/s0166-218x(99)00034-7

Crossref journal-article

Elsevier BV

Discrete Applied Mathematics (78)

Bibliography

Goerdt, A. (1999). A remark on random 2-SAT. Discrete Applied Mathematics, 96â97, 107â110.

Authors 1

Andreas Goerdt (first)

References 5 Referenced 5

10.1016/0020-0190(79)90002-4 / Inform. Process. Lett. / A linear-time algorithm for testing the truth of certain quantified boolean formulas by Aspvall (1979)
B. Bollóbas, Random Graphs, Academic Press, New York, 1985.
V. Chvátal, B. Reed, Mick gets some (the odds are on his side), Proceedings of the Thirtythird FOCS 1992, pp. 620–627. (10.1109/SFCS.1992.267789)
A. Goerdt, A threshold for unsatisfiability, in: J.M. Havel, V. Koubek (Eds.), Proceedings of the MFCS 1992, Lecture Notes in Computer Science, vol. 692, pp. 264–274. (10.1007/3-540-55808-X_25)
R.M. Karp, The transitive closure of a random digraph, Random Struct. Algorithms 1 (1990) 73–94. (10.1002/rsa.3240010106)

Dates

Type	When
Created	23 years, 1 month ago (July 25, 2002, 9:35 a.m.)
Deposited	5 years, 7 months ago (Jan. 14, 2020, 6:46 a.m.)
Indexed	1 year, 1 month ago (July 3, 2024, 8:11 p.m.)
Issued	25 years, 11 months ago (Oct. 1, 1999)
Published	25 years, 11 months ago (Oct. 1, 1999)
Published Print	25 years, 11 months ago (Oct. 1, 1999)

Funders 0

None

BibTeX

@article{Goerdt_1999, title={A remark on random 2-SAT}, volume={96–97}, ISSN={0166-218X}, url={http://dx.doi.org/10.1016/s0166-218x(99)00034-7}, DOI={10.1016/s0166-218x(99)00034-7}, journal={Discrete Applied Mathematics}, publisher={Elsevier BV}, author={Goerdt, Andreas}, year={1999}, month=oct, pages={107–110} }

JSON

{
  "indexed": {
    "date-parts": [
      [
        2024,
        7,
        4
      ]
    ],
    "date-time": "2024-07-04T00:11:44Z",
    "timestamp": 1720051904147
  },
  "reference-count": 5,
  "publisher": "Elsevier BV",
  "license": [
    {
      "start": {
        "date-parts": [
          [
            1999,
            10,
            1
          ]
        ],
        "date-time": "1999-10-01T00:00:00Z",
        "timestamp": 938736000000
      },
      "content-version": "tdm",
      "delay-in-days": 0,
      "URL": "https://www.elsevier.com/tdm/userlicense/1.0/"
    },
    {
      "start": {
        "date-parts": [
          [
            2013,
            7,
            17
          ]
        ],
        "date-time": "2013-07-17T00:00:00Z",
        "timestamp": 1374019200000
      },
      "content-version": "vor",
      "delay-in-days": 5038,
      "URL": "https://www.elsevier.com/open-access/userlicense/1.0/"
    }
  ],
  "content-domain": {
    "domain": [],
    "crossmark-restriction": false
  },
  "published-print": {
    "date-parts": [
      [
        1999,
        10
      ]
    ]
  },
  "DOI": "10.1016/s0166-218x(99)00034-7",
  "type": "journal-article",
  "created": {
    "date-parts": [
      [
        2002,
        7,
        25
      ]
    ],
    "date-time": "2002-07-25T13:35:45Z",
    "timestamp": 1027604145000
  },
  "page": "107-110",
  "source": "Crossref",
  "is-referenced-by-count": 5,
  "special_numbering": "C",
  "title": "A remark on random 2-SAT",
  "prefix": "10.1016",
  "volume": "96-97",
  "author": [
    {
      "given": "Andreas",
      "family": "Goerdt",
      "sequence": "first",
      "affiliation": []
    }
  ],
  "member": "78",
  "reference": [
    {
      "key": "10.1016/S0166-218X(99)00034-7_BIB1",
      "doi-asserted-by": "crossref",
      "first-page": "121",
      "DOI": "10.1016/0020-0190(79)90002-4",
      "article-title": "A linear-time algorithm for testing the truth of certain quantified boolean formulas",
      "volume": "8",
      "author": "Aspvall",
      "year": "1979",
      "journal-title": "Inform. Process. Lett."
    },
    {
      "key": "10.1016/S0166-218X(99)00034-7_BIB2",
      "unstructured": "B. Boll\u00f3bas, Random Graphs, Academic Press, New York, 1985."
    },
    {
      "key": "10.1016/S0166-218X(99)00034-7_BIB3",
      "doi-asserted-by": "crossref",
      "unstructured": "V. Chv\u00e1tal, B. Reed, Mick gets some (the odds are on his side), Proceedings of the Thirtythird FOCS 1992, pp. 620\u2013627.",
      "DOI": "10.1109/SFCS.1992.267789"
    },
    {
      "key": "10.1016/S0166-218X(99)00034-7_BIB4",
      "doi-asserted-by": "crossref",
      "unstructured": "A. Goerdt, A threshold for unsatisfiability, in: J.M. Havel, V. Koubek (Eds.), Proceedings of the MFCS 1992, Lecture Notes in Computer Science, vol. 692, pp. 264\u2013274.",
      "DOI": "10.1007/3-540-55808-X_25"
    },
    {
      "key": "10.1016/S0166-218X(99)00034-7_BIB5",
      "doi-asserted-by": "crossref",
      "unstructured": "R.M. Karp, The transitive closure of a random digraph, Random Struct. Algorithms 1 (1990) 73\u201394.",
      "DOI": "10.1002/rsa.3240010106"
    }
  ],
  "container-title": "Discrete Applied Mathematics",
  "original-title": [],
  "language": "en",
  "link": [
    {
      "URL": "https://api.elsevier.com/content/article/PII:S0166218X99000347?httpAccept=text/xml",
      "content-type": "text/xml",
      "content-version": "vor",
      "intended-application": "text-mining"
    },
    {
      "URL": "https://api.elsevier.com/content/article/PII:S0166218X99000347?httpAccept=text/plain",
      "content-type": "text/plain",
      "content-version": "vor",
      "intended-application": "text-mining"
    }
  ],
  "deposited": {
    "date-parts": [
      [
        2020,
        1,
        14
      ]
    ],
    "date-time": "2020-01-14T11:46:30Z",
    "timestamp": 1579002390000
  },
  "score": 1,
  "resource": {
    "primary": {
      "URL": "https://linkinghub.elsevier.com/retrieve/pii/S0166218X99000347"
    }
  },
  "subtitle": [],
  "short-title": [],
  "issued": {
    "date-parts": [
      [
        1999,
        10
      ]
    ]
  },
  "references-count": 5,
  "alternative-id": [
    "S0166218X99000347"
  ],
  "URL": "http://dx.doi.org/10.1016/S0166-218X(99)00034-7",
  "relation": {},
  "ISSN": [
    "0166-218X"
  ],
  "subject": [],
  "container-title-short": "Discrete Applied Mathematics",
  "published": {
    "date-parts": [
      [
        1999,
        10
      ]
    ]
  }
}