{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T11:17:22Z","timestamp":1648898242596},"reference-count":10,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1983,10,1]],"date-time":"1983-10-01T00:00:00Z","timestamp":433814400000},"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":[[1983,10]]},"DOI":"10.1016\/0020-0190(83)90049-2","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"117-120","source":"Crossref","is-referenced-by-count":0,"title":["A note on the complexity of a partition algorithm"],"prefix":"10.1016","volume":"17","author":[{"given":"Vladimir","family":"Lifschitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leon","family":"Pesotchinsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(83)90049-2_BIB1","series-title":"Convergence of Probability Measures","author":"Billingsley","year":"1968"},{"key":"10.1016\/0020-0190(83)90049-2_BIB2","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1137\/0206046","article-title":"Determining the stability number of graph","volume":"6","author":"Chv\u00e1tal","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(83)90049-2_BIB3","doi-asserted-by":"crossref","first-page":"1402","DOI":"10.1287\/opre.28.6.1402","article-title":"Hard knapsack problems","volume":"28","author":"Chv\u00e1tal","year":"1980","journal-title":"Oper. Res."},{"key":"10.1016\/0020-0190(83)90049-2_BIB4","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(83)90049-2_BIB5","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/321812.321823","article-title":"Computing partitions with applications to the knapsack problem","volume":"21","author":"Horowitz","year":"1974","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/0020-0190(83)90049-2_BIB6","doi-asserted-by":"crossref","first-page":"1075","DOI":"10.2307\/1970462","article-title":"A. Tauberian theorem for partitions","volume":"42","author":"Ingham","year":"1941","journal-title":"Ann. Math."},{"key":"10.1016\/0020-0190(83)90049-2_BIB7","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1090\/S0002-9939-1980-0560587-2","article-title":"The efficiency of an algorithm of integer programming: A probabilistic analysis","volume":"79","author":"Lifschitz","year":"1980","journal-title":"Proc. AMS"},{"key":"10.1016\/0020-0190(83)90049-2_BIB8","unstructured":"V. Lifschitz and B. Pittel, The worst-case performance and the most probable performance of a set-covering algorithm, SIAM J. Comput. (to appear)."},{"key":"10.1016\/0020-0190(83)90049-2_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0208001","article-title":"Determining the chromatic number of graph","volume":"8","author":"McDiarmid","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(83)90049-2_BIB10","first-page":"A","article-title":"On the expected number of branches in analytic tableaux analyses in propositional calculus","volume":"25","author":"Plotkin","year":"1978","journal-title":"Notices AMS"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900492?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083900492?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:56:49Z","timestamp":1555073809000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019083900492"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,10]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1983,10]]}},"alternative-id":["0020019083900492"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(83)90049-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1983,10]]}}}