{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,16]],"date-time":"2026-05-16T04:48:06Z","timestamp":1778906886970,"version":"3.51.4"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,8,27]],"date-time":"2015-08-27T00:00:00Z","timestamp":1440633600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s10208-015-9283-7","type":"journal-article","created":{"date-parts":[[2015,8,26]],"date-time":"2015-08-26T18:47:22Z","timestamp":1440614842000},"page":"61-72","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On Topological Lower Bounds for Algebraic Computation Trees"],"prefix":"10.1007","volume":"17","author":[{"given":"Andrei","family":"Gabrielov","sequence":"first","affiliation":[]},{"given":"Nicolai","family":"Vorobjov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,27]]},"reference":[{"key":"9283_CR1","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, Lower bounds for algebraic computation trees, in Proceedings of 15th Annual ACM Symposium on Theory of Computing 1983, 80\u201386.","DOI":"10.1145\/800061.808735"},{"key":"9283_CR2","first-page":"73","volume":"13","author":"P B\u00fcrgisser","year":"2005","unstructured":"P. B\u00fcrgisser, F. Cucker, Variations by complexity theorists on three themes of Euler, B\u00e9zout, Betti, and Poincar\u00e9, in Complexity of Computations and Proofs (Jan Krajicek ed.), Quaderini di Matematica 13 (2005), 73-152.","journal-title":"Quaderini di Matematica"},{"key":"9283_CR3","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0022-0000(79)90054-0","volume":"18","author":"D Dobkin","year":"1979","unstructured":"D. Dobkin and R.J. Lipton, On the complexity of computations under varying sets of primitives, J. Comput. Syst. Sci. 18 (1979), 86-91.","journal-title":"J. Comput. Syst. Sci."},{"key":"9283_CR4","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s00454-004-1105-7","volume":"33","author":"A Gabrielov","year":"2005","unstructured":"A. Gabrielov, N. Vorobjov, Betti numbers of semialgebraic sets defined by quantifier-free formulae, Discrete Comput. Geom. 33 (2005), 395-401.","journal-title":"Discrete Comput. Geom."},{"key":"9283_CR5","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1112\/jlms\/jdp006","volume":"80","author":"A Gabrielov","year":"2009","unstructured":"A. Gabrielov, N. Vorobjov, Approximation of definable sets by compact families, and upper bounds on homotopy and homology, J. London Math. Soc. 80 (2009), 35-54.","journal-title":"J. London Math. Soc."},{"key":"9283_CR6","doi-asserted-by":"crossref","unstructured":"A. Gabrielov, N. Vorobjov, T. Zell, Betti numbers of semialgebraic and sub-Pfaffian sets, J. London Math. Soc. 69, part 1 (2004), 27\u201343.","DOI":"10.1112\/S0024610703004939"},{"key":"9283_CR7","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1006\/jcss.1997.1495","volume":"55","author":"ACC Yao","year":"1997","unstructured":"A.C.C. Yao, Decision tree complexity and Betti numbers, J. Comput. Syst. Sci. 55 (1997), 36-43.","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9283-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-015-9283-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9283-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-015-9283-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T11:05:16Z","timestamp":1559127916000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-015-9283-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,27]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["9283"],"URL":"https:\/\/doi.org\/10.1007\/s10208-015-9283-7","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,27]]}}}