{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T06:25:49Z","timestamp":1780727149557,"version":"3.54.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1979,2,1]],"date-time":"1979-02-01T00:00:00Z","timestamp":286675200000},"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":12585,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1979,2]]},"DOI":"10.1016\/0022-0000(79)90054-0","type":"journal-article","created":{"date-parts":[[2003,12,5]],"date-time":"2003-12-05T06:41:56Z","timestamp":1070606516000},"page":"86-91","source":"Crossref","is-referenced-by-count":76,"title":["On the complexity of computations under varying sets of primitives"],"prefix":"10.1016","volume":"18","author":[{"given":"David P.","family":"Dobkin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard J.","family":"Lipton","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(79)90054-0_BIB1","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0022-0000(76)80051-7","article-title":"A nonlinear lower bound on linear search tree programs for solving knapsack problems","volume":"13","author":"Dobkin","year":"1976","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(79)90054-0_BIB2","series-title":"ACM Symposium on the Theory of Computing","article-title":"On some generalizations of binary search","author":"Dobkin","year":"1974"},{"key":"10.1016\/0022-0000(79)90054-0_BIB3","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1016\/0022-0000(78)90026-0","article-title":"A lower bound of 12n2 on linear search programs for the knapsack problem","volume":"16","author":"Dobkin","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(79)90054-0_BIB4","series-title":"Convex Polytopes","author":"Gr\u00fcinbaum","year":"1967"},{"key":"10.1016\/0022-0000(79)90054-0_BIB5","series-title":"Algebraic Geometry","author":"Lefschetz","year":"1953"},{"key":"10.1016\/0022-0000(79)90054-0_BIB6","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1016\/S0022-0000(72)80034-5","article-title":"Proving the simultaneous positivity of linear forms","volume":"13","author":"Rabin","year":"1972","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(79)90054-0_BIB7","series-title":"12th Annual Symposium on Switching and Automata Theory","first-page":"216","article-title":"Computing the maximum and the median","author":"Reincold","year":"1971"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000079900540?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000079900540?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T07:20:31Z","timestamp":1550301631000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000079900540"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,2]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,2]]}},"alternative-id":["0022000079900540"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(79)90054-0","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1979,2]]}}}