{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T11:10:23Z","timestamp":1649157023840},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1981,6,1]],"date-time":"1981-06-01T00:00:00Z","timestamp":360201600000},"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":[[1981,6]]},"DOI":"10.1016\/0020-0190(81)90112-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"138-141","source":"Crossref","is-referenced-by-count":5,"title":["Linear decision trees are too weak for convex hull problem"],"prefix":"10.1016","volume":"12","author":[{"given":"Jerzy W.","family":"Jaromczyk","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(81)90112-5_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1976"},{"key":"10.1016\/0020-0190(81)90112-5_BIB2","series-title":"Techn. Rep. No. SOCS 79.2","article-title":"On the complexity of finding the convex hull of a set of points","author":"Avis","year":"1979"},{"key":"10.1016\/0020-0190(81)90112-5_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\/0020-0190(81)90112-5_BIB4","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(80)90064-2","article-title":"On the \u03a9(n log 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\/0020-0190(81)90112-5_BIB5","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","article-title":"An efficient algorithm for determining the convex hull of a finite planar set","volume":"1","author":"Graham","year":"1972","journal-title":"Information Processing Lett."},{"key":"10.1016\/0020-0190(81)90112-5_BIB6","series-title":"Convex Polytopes","author":"Gr\u00fcnbaum","year":"1967"},{"key":"10.1016\/0020-0190(81)90112-5_BIB7","series-title":"Rep. STAN-CS-79-733","article-title":"A lower bound to finding convex hulls","author":"Yao","year":"1979"},{"key":"10.1016\/0020-0190(81)90112-5_BIB8","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/0020-0190(80)90125-8","article-title":"Comments on a lower bound for convex hull determination","volume":"11","author":"Avis","year":"1980","journal-title":"Information Processing Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019081901125?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019081901125?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:52:20Z","timestamp":1555087940000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019081901125"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,6]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1981,6]]}},"alternative-id":["0020019081901125"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(81)90112-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1981,6]]}}}