{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T17:52:05Z","timestamp":1649181125248},"reference-count":5,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1991,10,1]],"date-time":"1991-10-01T00:00:00Z","timestamp":686275200000},"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":[[1991,10]]},"DOI":"10.1016\/0020-0190(91)90017-c","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"101-106","source":"Crossref","is-referenced-by-count":0,"title":["On the complexity of the extreme points decision problem"],"prefix":"10.1016","volume":"40","author":[{"given":"Xiaodong","family":"Wang","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(91)90017-C_BIB1","series-title":"MIT Research Seminar Series, Rept. No. MIT\u29f8LCS\u29f8RSS 3","article-title":"Computational Geometry \u2014 Lecture Notes for 18.409","author":"Aggarwal","year":"1988"},{"key":"10.1016\/0020-0190(91)90017-C_BIB2","first-page":"80","article-title":"Lower bounds for algebraic computation trees","author":"Ben-Or","year":"1983","journal-title":"Proc. 15th Ann. ACM Sympos. on Theory of Computing"},{"key":"10.1016\/0020-0190(91)90017-C_BIB3","series-title":"Computational Geometry \u2014 An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/0020-0190(91)90017-C_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(82)90002-5","article-title":"Lower bounds for algebraic decision trees","volume":"3","author":"Steele","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(91)90017-C_BIB5","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1145\/322276.322289","article-title":"A lower bound for finding convex hulls","volume":"28","author":"Yao","year":"1981","journal-title":"J. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190017C?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190017C?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:25:18Z","timestamp":1555143918000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909190017C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,10]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1991,10]]}},"alternative-id":["002001909190017C"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90017-c","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,10]]}}}