{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:03:27Z","timestamp":1743015807006,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662480533"},{"type":"electronic","value":"9783662480540"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48054-0_30","type":"book-chapter","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T11:57:29Z","timestamp":1439207849000},"page":"361-371","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Log-Concavity and Lower Bounds for Arithmetic Circuits"],"prefix":"10.1007","author":[{"given":"Ignacio","family":"Garc\u00eda-Marco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Koiran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Tavenas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, M., Vinay, V.: Arithmetic circuits: a chasm at depth four. In: 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, October 25\u201328, 2008, Philadelphia, PA, USA, pp. 67\u201375 (2008)","DOI":"10.1109\/FOCS.2008.32"},{"key":"30_CR2","series-title":"Algorithms and Computation in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04179-6","volume-title":"Completeness and Reduction in Algebraic Complexity Theory","author":"P B\u00fcrgisser","year":"2000","unstructured":"B\u00fcrgisser, P.: Completeness and Reduction in Algebraic Complexity Theory. Algorithms and Computation in Mathematics. Springer, Heidelberg (2000)"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Eisenbrand, F., Pach, J., Rothvo\u00df, T., Sopher, N.B.: Convexly independent subsets of the Minkowski sum of planar point sets. Electron. J. Combin., 15(1): Note 8, 4 (2008)","DOI":"10.37236\/883"},{"key":"30_CR4","series-title":"Cambridge Mathematical Library","volume-title":"Inequalities","author":"GH Hardy","year":"1988","unstructured":"Hardy, G.H., Littlewood, J.E., P\u00f3lya, G.: Inequalities. Cambridge Mathematical Library. Cambridge University Press, Cambridge (1988). Reprint of the 1952 edition"},{"issue":"10","key":"30_CR5","first-page":"403","volume":"9","author":"P Hrubes","year":"2013","unstructured":"Hrubes, P.: A note on the real $$\\tau $$-conjecture and the distribution of complex roots. Theo. Comput. 9(10), 403\u2013411 (2013). http:\/\/eccc.hpi-web.de\/report\/2012\/121\/","journal-title":"Theo. Comput."},{"issue":"3","key":"30_CR6","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1090\/S0002-9947-1923-1501248-1","volume":"25","author":"JI Hutchinson","year":"1923","unstructured":"Hutchinson, J.I.: On a remarkable class of entire functions. Trans. Amer. Math. Soc. 25(3), 325\u2013332 (1923)","journal-title":"Trans. Amer. Math. Soc."},{"issue":"3","key":"30_CR7","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1145\/322326.322341","volume":"29","author":"M Jerrum","year":"1982","unstructured":"Jerrum, M., Snir, M.: Some exact complexity results for straight-line computations over semirings. J. ACM (JACM) 29(3), 874\u2013897 (1982)","journal-title":"J. ACM (JACM)"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Karavelas, M.I., Tzanaki, E.: The maximum number of faces of the Minkowski sum of two convex polytopes. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 11\u201328 (2012)","DOI":"10.1137\/1.9781611973099.2"},{"key":"30_CR9","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s00037-004-0186-2","volume":"13","author":"P Koiran","year":"2004","unstructured":"Koiran, P.: Valiant\u2019s model and the cost of computing integers. Comput. Complex. 13, 131\u2013146 (2004)","journal-title":"Comput. Complex."},{"key":"30_CR10","unstructured":"Koiran, P.: Shallow circuits with high-powered inputs. In: Proceedings of the Second Symposium on Innovations in Computer Science (ICS 2011) (2011). http:\/\/arxiv.org\/abs\/1004.4960"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.tcs.2012.03.041","volume":"448","author":"P Koiran","year":"2012","unstructured":"Koiran, P.: Arithmetic circuits: the chasm at depth four gets wider. Theoret. Comput. Sci. 448, 56\u201365 (2012)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"30_CR12","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10208-014-9216-x","volume":"15","author":"P Koiran","year":"2014","unstructured":"Koiran, P., Portier, N., Tavenas, S., Thomass\u00e9, S.: A $$\\tau $$-conjecture for Newton polygons. Found. Comput. Math. 15(1), 185\u2013197 (2014)","journal-title":"Found. Comput. Math."},{"issue":"3","key":"30_CR13","doi-asserted-by":"publisher","first-page":"259","DOI":"10.2307\/2325063","volume":"99","author":"DC Kurtz","year":"1992","unstructured":"Kurtz, D.C.: A sufficient condition for all the roots of a polynomial to be real. Amer. Math. Monthly 99(3), 259\u2013263 (1992)","journal-title":"Amer. Math. Monthly"},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1007\/978-3-642-40313-2_71","volume-title":"Mathematical Foundations of Computer Science 2013","author":"S Tavenas","year":"2013","unstructured":"Tavenas, S.: Improved bounds for reduction to depth 4 and depth 3. In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol. 8087, pp. 813\u2013824. Springer, Heidelberg (2013)"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Completeness classes in algebra. In: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, STOC 1979, pp. 249\u2013261. ACM, New York, NY, USA (1979)","DOI":"10.1145\/800135.804419"},{"key":"30_CR16","unstructured":"Valiant, L.G.: Negation can be exponentially powerful. In: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, pp. 189\u2013196. ACM (1979). Journal version in Theo. Comput. Sci. 12(3), 303\u2013314 (1980)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48054-0_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T14:19:35Z","timestamp":1675865975000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48054-0_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662480533","9783662480540"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48054-0_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"11 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}