{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,26]],"date-time":"2023-08-26T17:21:27Z","timestamp":1693070487594},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,12,1]],"date-time":"1988-12-01T00:00:00Z","timestamp":596937600000},"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":8994,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1988,12]]},"DOI":"10.1016\/0166-218x(88)90121-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"35-51","source":"Crossref","is-referenced-by-count":13,"title":["Probabilistic performance of a heuristic for the satisfiability problem"],"prefix":"10.1016","volume":"22","author":[{"given":"John","family":"Franco","sequence":"first","affiliation":[]},{"given":"Yuan Chuan","family":"Ho","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(88)90121-7_BIB1","series-title":"Ph.D. Thesis","article-title":"Probabilistic analysis and performance measurement of algorithms for the satisfiability problem","author":"Chao","year":"1985"},{"key":"10.1016\/0166-218X(88)90121-7_BIB2","doi-asserted-by":"crossref","first-page":"1106","DOI":"10.1137\/0215080","article-title":"Probabilistic analysis of two heuristics for the 3-satisfiability problem","volume":"15","author":"Chao","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(88)90121-7_BIB3_1","series-title":"Tech. Rept. No. 165","article-title":"Probabilistic analysis of a generalization of the unit clause literal selection heuristic for the k-satisfiability problem","author":"Chao","year":"1985"},{"key":"10.1016\/0166-218X(88)90121-7_BIB3_2","unstructured":"also: Inform. Sci. (to appear)"},{"key":"10.1016\/0166-218X(88)90121-7_BIB4","first-page":"163","article-title":"Introduction to Queueing Theory","author":"Cooper","year":"1972"},{"key":"10.1016\/0166-218X(88)90121-7_BIB5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321033.321034","article-title":"A computing procedure for quantification theory","volume":"7","author":"Davis","year":"1960","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(88)90121-7_BIB6","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0020-0190(86)90051-7","article-title":"On the probabilistic performance of algorithms for the satisfiability problem","volume":"23","author":"Franco","year":"1986","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(88)90121-7_BIB7","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0166-218X(83)90017-3","article-title":"Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem","volume":"5","author":"Franco","year":"1983","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(88)90121-7_BIB8","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0166-218X(87)90032-1","article-title":"Correction to probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem","volume":"17","author":"Franco","year":"1987","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0166-218X(88)90121-7_BIB9","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(77)90054-8","article-title":"On the complexity of regular resolution and the Davis-Putnam procedure","volume":"4","author":"Galil","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0166-218X(88)90121-7_BIB10","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/0020-0190(82)90110-7","article-title":"Average time analyses of simplified Davis-Putnam procedures","volume":"15","author":"Goldberg","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0166-218X(88)90121-7_BIB11","first-page":"A","article-title":"On the expected number of branches in analytic tableaux analysis in propositional calculus","volume":"25","author":"Plotkin","year":"1978","journal-title":"Notices Amer. Math. Soc."},{"key":"10.1016\/0166-218X(88)90121-7_BIB12","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/S0004-3702(83)80007-1","article-title":"Search rearrangement backtracking and polynomial average time","volume":"21","author":"Purdom","year":"1983","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0166-218X(88)90121-7_BIB13","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1137\/0214067","article-title":"The pure literal rule and polynomial average time","volume":"14","author":"Purdom","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(88)90121-7_BIB14","first-page":"465","article-title":"The Analysis of Algorithms","author":"Purdom","year":"1985"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X88901217?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X88901217?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:54:57Z","timestamp":1555134897000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X88901217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,12]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,12]]}},"alternative-id":["0166218X88901217"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(88)90121-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1988,12]]}}}