{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:59:13Z","timestamp":1760061553744},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1982,3,1]],"date-time":"1982-03-01T00:00:00Z","timestamp":383788800000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1982,3]]},"DOI":"10.1016\/0196-6774(82)90002-5","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T03:44:36Z","timestamp":1108007076000},"page":"1-8","source":"Crossref","is-referenced-by-count":95,"title":["Lower bounds for algebraic decision trees"],"prefix":"10.1016","volume":"3","author":[{"given":"J","family":"Michael Steele","sequence":"first","affiliation":[]},{"given":"Andrew C","family":"Yao","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(82)90002-5_BIB1","first-page":"50","article-title":"Real algebraic geometry (The 16th Hilbert problem)","volume":"28","author":"Arnold","year":"1976"},{"key":"10.1016\/0196-6774(82)90002-5_BIB2","series-title":"Constructive Approaches to Mathematical Models","article-title":"Some Recollections from 30 Years Ago","author":"Bott","year":"1979"},{"key":"10.1016\/0196-6774(82)90002-5_BIB3","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\/0196-6774(82)90002-5_BIB4","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\/0196-6774(82)90002-5_BIB5","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0022-0000(79)90054-0","article-title":"On the complexity of varying sets of primitives","volume":"18","author":"Dobkin","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0196-6774(82)90002-5_BIB6","series-title":"Foundations of Algebraic Topology","author":"Eilenberg","year":"1952"},{"key":"10.1016\/0196-6774(82)90002-5_BIB7","first-page":"101","volume":"Vol. 2","author":"Enriques","year":"1915"},{"key":"10.1016\/0196-6774(82)90002-5_BIB8","series-title":"Topology","author":"Hocking","year":"1961"},{"key":"10.1016\/0196-6774(82)90002-5_BIB9","first-page":"275","article-title":"On the Betti numbers of real varieties","volume":"15","author":"Milnor","year":"1964"},{"key":"10.1016\/0196-6774(82)90002-5_BIB10","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\/0196-6774(82)90002-5_BIB11","series-title":"Proceedings, Twelfth Annual Symposium on Switching and Automata Theory","first-page":"216","article-title":"Computing the maximum and the median","author":"Reingold","year":"1971"},{"key":"10.1016\/0196-6774(82)90002-5_BIB12","first-page":"44","article-title":"Elements of the Theory of Algebraic Curves","author":"Seidenberg","year":"1968"},{"key":"10.1016\/0196-6774(82)90002-5_BIB13","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1515\/crll.1826.1.349","article-title":"Einige Gesetze \u00fcber die Theilung der Ebene und des Raumes","author":"Steiner","year":"1826","journal-title":"J. Reine Angew Math."},{"key":"10.1016\/0196-6774(82)90002-5_BIB14","doi-asserted-by":"crossref","first-page":"647","DOI":"10.2307\/2320333","article-title":"On the division of the plane by lines","volume":"85","author":"Wetzel","year":"1978","journal-title":"Amer. Math. Monthly"},{"key":"10.1016\/0196-6774(82)90002-5_BIB15","series-title":"Proceedings, Sixteenths Annual Symposium on the Foundations of Computer Science","first-page":"85","article-title":"On the complexity of comparison problems using linear functions","author":"Yao","year":"1975"},{"key":"10.1016\/0196-6774(82)90002-5_BIB16","article-title":"A Lower Bound to Finding Convex Hulls","author":"Yao","year":"1979","journal-title":"Stanford Computer Science Report STAN-CS-79-733"},{"key":"10.1016\/0196-6774(82)90002-5_BIB17","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."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900025?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900025?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T01:52:14Z","timestamp":1548726734000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677482900025"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,3]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,3]]}},"alternative-id":["0196677482900025"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(82)90002-5","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1982,3]]}}}