{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:05:30Z","timestamp":1750694730996},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,9,1]],"date-time":"2016-09-01T00:00:00Z","timestamp":1472688000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["comput. complex."],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s00037-016-0145-8","type":"journal-article","created":{"date-parts":[[2016,9,2]],"date-time":"2016-09-02T17:47:51Z","timestamp":1472838471000},"page":"687-715","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Topological lower bounds for arithmetic networks"],"prefix":"10.1007","volume":"26","author":[{"given":"Andrei","family":"Gabrielov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolai","family":"Vorobjov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,1]]},"reference":[{"key":"145_CR1","unstructured":"P. B\u00fcrgisser & F. Cucker (2005). Variations by complexity theorists on three themes of Euler, B\u00e9zout, Betti, and Poincar\u00e9. In Complexity of Computations and Proofs (Jan Krajicek ed.), volume 13 of Quaderini di Matematica, 73\u2013152."},{"issue":"3","key":"145_CR2","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s00454-004-1105-7","volume":"33","author":"A. Gabrielov","year":"2005","unstructured":"Gabrielov A., Vorobjov N. (2005) Betti numbers of semialgebraic sets defined by quantifier-free formulae. Discrete Comput. Geom. 33(3): 395\u2013401","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"145_CR3","first-page":"493","volume":"80","author":"A. Gabrielov","year":"2009","unstructured":"Gabrielov A., Vorobjov N. (2009) Approximation of definable sets by compact families, and upper bounds on homotopy and homology. J. London Math. Soc. 80(2): 493\u2013496","journal-title":"J. London Math. Soc."},{"key":"145_CR4","doi-asserted-by":"publisher","unstructured":"A. Gabrielov & N. Vorobjov (2015). On topological lower bounds for algebraic computation trees. Found. Comput. Math., doi:\n                        10.1007\/s10208-015-9283-7\n                        \n                    .","DOI":"10.1007\/s10208-015-9283-7"},{"issue":"2","key":"145_CR5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1112\/S0024610703004939","volume":"69","author":"A. Gabrielov","year":"2004","unstructured":"Gabrielov A., Vorobjov N., Zell T. (2004) Betti numbers of semialgebraic and sub-Pfaffian sets. J. London Math. Soc. 69(2): 27\u201343","journal-title":"J. London Math. Soc."},{"key":"145_CR6","doi-asserted-by":"crossref","unstructured":"J. von zur Gathen (1986). Parallel arithmetic computations: a survey. In Proceedings of the 12th Symposium Bratislava, Czechoslovakia August 25-29, 1986 (J. Gruska, B. Rovan, J. Wiedermann eds.), 93\u2013112. Springer Lecture Notes in Computer Science, 233.","DOI":"10.1007\/BFb0016236"},{"key":"145_CR7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF01613615","volume":"7","author":"J.L. Monta\u00f1a","year":"1996","unstructured":"Monta\u00f1a J.L., Morais J.E., Pardo L.M. (1996) Lower bounds for arithmetic networks II: sum of Betti numbers. Appl. Algebra Engrg. Comm. Comput. 7: 41\u201351","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"145_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01270397","volume":"4","author":"J.L. Monta\u00f1a","year":"1993","unstructured":"Monta\u00f1a J.L., Pardo L.M. (1993) Lower bounds for arithmetic networks. Appl. Algebra Engrg. Comm. Comput. 4: 1\u201324","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"145_CR9","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1006\/jcss.1997.1495","volume":"55","author":"A.C.C. Yao","year":"1997","unstructured":"Yao A.C.C. (1997) Decision tree complexity and Betti numbers. J. Comput. Syst. Sci. 55: 36\u201343","journal-title":"J. Comput. Syst. Sci."}],"container-title":["computational complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00037-016-0145-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-016-0145-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-016-0145-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-016-0145-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,30]],"date-time":"2017-08-30T09:28:03Z","timestamp":1504085283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00037-016-0145-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9,1]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["145"],"URL":"https:\/\/doi.org\/10.1007\/s00037-016-0145-8","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9,1]]}}}