{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:08:26Z","timestamp":1761620906094},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1984,10,1]],"date-time":"1984-10-01T00:00:00Z","timestamp":465436800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1984,10]]},"DOI":"10.1007\/bf01874393","type":"journal-article","created":{"date-parts":[[2005,7,2]],"date-time":"2005-07-02T18:31:47Z","timestamp":1120329107000},"page":"273-289","source":"Crossref","is-referenced-by-count":23,"title":["Probabilistic analysis of the pure literal heuristic for the satisfiability problem"],"prefix":"10.1007","volume":"1","author":[{"given":"John","family":"Franco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01874393_CR1","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1137\/0210043","volume":"10","author":"C.A. Brown","year":"1981","unstructured":"C.A. Brown and P.W. Purdom, An average time analysis of backtracking, SIAM J. Comp. 10 (1981)583.","journal-title":"SIAM J. Comp."},{"key":"BF01874393_CR2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M. Davis","year":"1960","unstructured":"M. Davis and H. Putnam, A computing procedure for quantification theory, J. Assoc. Comput. Mech. 7(1960)201.","journal-title":"J. Assoc. Comput. Mech."},{"key":"BF01874393_CR3","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0166-218X(83)90017-3","volume":"5","author":"J. Franco","year":"1983","unstructured":"J. Franco and M. Pauli, Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem, Report No. CES-81-3 (Case Western Reserve University, 1981), Discr. Appl. Math. 5(1983)77.","journal-title":"Discr. Appl. Math."},{"key":"BF01874393_CR4","unstructured":"A. Goldberg, Average case complexity of the satisfiability problem. Proc. 4th Workshop on Automated Deduction (Austin, Texas, 1979) p. 1\u20136."},{"key":"BF01874393_CR5","unstructured":"R.M. Karp, The probabilistic analysis of some combinatorial search problems, in: Algorithms and Complexity: New Directions and Recent Results, ed. J.F. Traub (Academic Press, 1976) p. 1\u201319."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01874393.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01874393\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01874393","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T14:56:45Z","timestamp":1557500205000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01874393"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,10]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984,10]]}},"alternative-id":["BF01874393"],"URL":"https:\/\/doi.org\/10.1007\/bf01874393","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,10]]}}}