{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T20:08:09Z","timestamp":1672690089591},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,9,1]],"date-time":"1982-09-01T00:00:00Z","timestamp":399686400000},"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":11277,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1982,9]]},"DOI":"10.1016\/0304-3975(82)90041-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"321-330","source":"Crossref","is-referenced-by-count":6,"title":["Comparisons between linear functions can help"],"prefix":"10.1016","volume":"19","author":[{"given":"Marc","family":"Snir","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(82)90041-X_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\/0304-3975(82)90041-X_BIB2","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\/0304-3975(82)90041-X_BIB3","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0022-0000(79)90054-0","article-title":"On the complexity of computations under varying sets of primitives","volume":"18","author":"Dobkin","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(82)90041-X_BIB4","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(80)90064-2","article-title":"On the \u03a9(n lg n) lower bound for convex hull and maximal vector determination","volume":"10","author":"van Emde Boas","year":"1980","journal-title":"Information Processing Lett."},{"key":"10.1016\/0304-3975(82)90041-X_BIB5","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1145\/359545.359553","article-title":"On the complexity of computing the measure of \u22c3[ai, bi]","volume":"21","author":"Fredman","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(82)90041-X_BIB6","series-title":"Convex Polytopes","author":"Gr\u00fcnbaum","year":"1967"},{"key":"10.1016\/0304-3975(82)90041-X_BIB7","series-title":"Annals of Mathematics Studies","first-page":"189","article-title":"Cartesian products of termination games","volume":"39","author":"Holladay","year":"1957"},{"key":"10.1016\/0304-3975(82)90041-X_BIB8","series-title":"The Art of Computer Programming, Vol. 3: Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/0304-3975(82)90041-X_BIB9","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1145\/321906.321910","article-title":"On finding the maxima of a set of vectors","volume":"22","author":"Kung","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(82)90041-X_BIB10","doi-asserted-by":"crossref","first-page":"639","DOI":"10.1016\/S0022-0000(72)80034-5","article-title":"Proving simultaneous positivity of linear forms","volume":"6","author":"Robin","year":"1972","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(82)90041-X_BIB11","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1109\/SWAT.1971.9","article-title":"Computing the maxima and the median","author":"Reingold","year":"1971","journal-title":"Proc. IEEE 12th Annual Symposium on Switching and Automata Theory"},{"key":"10.1016\/0304-3975(82)90041-X_BIB12","series-title":"Research Report CSR-66-80","article-title":"Comparison between linear functions can help","author":"Snir","year":"1980"},{"key":"10.1016\/0304-3975(82)90041-X_BIB13","first-page":"305","article-title":"Proving lower bounds for linear decision trees","author":"Snir","year":"1981","journal-title":"Proc. 8th International Colloquium on Automata, Languages and Programming"},{"key":"10.1016\/0304-3975(82)90041-X_BIB14","first-page":"85","article-title":"On the complexity of comparison problems using linear functions","author":"Yao","year":"1975","journal-title":"Proc. IEEE 16th Annual Symposium on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(82)90041-X_BIB15","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1137\/0209028","article-title":"On the polyhedral decision problem","volume":"9","author":"Yao","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(82)90041-X_BIB16","first-page":"267","article-title":"On lifted problems","author":"Yap","year":"1978","journal-title":"Proc. IEEE 19th Annual Symposium on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(82)90041-X_BIB17","unstructured":"C.K. Yap, Private communication."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758290041X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758290041X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:26:50Z","timestamp":1555111610000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439758290041X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["030439758290041X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(82)90041-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1982,9]]}}}