{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T19:04:15Z","timestamp":1771614255776,"version":"3.50.1"},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,8,1]],"date-time":"1992-08-01T00:00:00Z","timestamp":712627200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1992,8]]},"DOI":"10.1016\/0020-0190(92)90029-u","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"53-55","source":"Crossref","is-referenced-by-count":58,"title":["On the greedy algorithm for satisfiability"],"prefix":"10.1016","volume":"43","author":[{"given":"Elias","family":"Koutsoupias","sequence":"first","affiliation":[]},{"given":"Christos H.","family":"Papadimitriou","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90029-U_BIB1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0304-3975(91)90315-S","article-title":"Counting the number of solutions for instances of satisfiability","volume":"81","author":"Dubois","year":"1991","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(92)90029-U_BIB2","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(92)90029-U_BIB3","article-title":"On the complexity of the satisfiability problem","author":"Goldberg","year":"1979"},{"key":"10.1016\/0020-0190(92)90029-U_BIB4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","article-title":"A guided tour of Chernoff bounds","volume":"33","author":"Hagerup","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90029-U_BIB5","unstructured":"C.H. Papadimitriou, On the complexity of selecting a satisfying truth assignment, in: Proc. 1991 Conf. on Foundations of Computer Science."},{"key":"10.1016\/0020-0190(92)90029-U_BIB6","unstructured":"B. Selman, H. Levesque and D. Mitchell, A new method for solving hard satisfiability problems, to appear."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290029U?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290029U?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:27:59Z","timestamp":1555144079000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290029U"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["002001909290029U"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90029-u","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,8]]}}}