{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T19:13:31Z","timestamp":1648840411557},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Complexity"],"published-print":{"date-parts":[[1991,9]]},"DOI":"10.1007\/bf01200063","type":"journal-article","created":{"date-parts":[[2005,2,18]],"date-time":"2005-02-18T12:07:51Z","timestamp":1108728471000},"page":"257-268","source":"Crossref","is-referenced-by-count":1,"title":["Lower bounds for the non-linear complexity of algebraic computation trees with integer inputs"],"prefix":"10.1007","volume":"1","author":[{"given":"Michael D.","family":"Hirsch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"M. Ben-Or. Lower bounds for algebraic computation trees.Proceedings 15th ACM STOC, pages 80?86, 1983.","DOI":"10.1145\/800061.808735"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D. Coppersmith","year":"1990","unstructured":"D. Coppersmith and S. Winograd. Matrix multiplications via arithmetic progressions.Journal of Symbolic Computation, 9:251?280, 1990.","journal-title":"Journal of Symbolic Computation"},{"key":"CR3","unstructured":"A. Lubiw. A RAM lower bound for the integer distinctness problem. To appear inInformation and Computation."},{"key":"CR4","unstructured":"A. Lubiw and A. Racs. A lower bound for the integer distinctness problem. InFrench-Israel Conference on Combinatorics, November 1988."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1090\/S0002-9939-1964-0161339-9","volume":"15","author":"J. Milnor","year":"1964","unstructured":"J. Milnor. On the Betti-numbers of real varieties.Proceedings of the American Mathematical Society, 15:275?280, 1964.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-13866-8","volume-title":"How to multiply matrices faster","author":"V. Y. Pan","year":"1984","unstructured":"V. Y. Pan.How to multiply matrices faster. Lecture Notes in Computer Science. Springer Verlag, Berlin, 1984."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(82)90002-5","volume":"3","author":"M. Steele","year":"1982","unstructured":"M. Steele and A. Yao. Lower bounds for algebraic decision trees.Journal of Algorithms, 3:1?8, 1982.","journal-title":"Journal of Algorithms"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"R. Thom. Sur l'homologie des vari\u00e9t\u00e9s alg\u00e9briques r\u00e9elles. In S. S. Cairns, editor,Differential and Combinatorial Topology, pages 255?265. Princeton University Press, 1965.","DOI":"10.1515\/9781400874842-016"},{"key":"CR9","doi-asserted-by":"crossref","unstructured":"A. C.-C. Yao. Lower bounds for algebraic computation trees with integer inputs.Proceedings 30th Annual Symposium on Fundamentals of Computer Science, pages 308?313, 1989.","DOI":"10.1109\/SFCS.1989.63495"},{"key":"CR10","first-page":"655","volume":"20","author":"A. C.-C. Yao","year":"1989","unstructured":"A. C.-C. Yao. Lower bounds for algebraic computation trees with integer inputs.SIAM Journal on Computing, 20:655?668, 1989.","journal-title":"SIAM Journal on Computing"}],"container-title":["Computational Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01200063.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01200063\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01200063","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T16:54:36Z","timestamp":1556729676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01200063"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["BF01200063"],"URL":"https:\/\/doi.org\/10.1007\/bf01200063","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}