{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T09:06:33Z","timestamp":1776071193869,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,4,19]],"date-time":"2011-04-19T00:00:00Z","timestamp":1303171200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["comput. complex."],"published-print":{"date-parts":[[2011,9]]},"DOI":"10.1007\/s00037-011-0007-3","type":"journal-article","created":{"date-parts":[[2011,4,18]],"date-time":"2011-04-18T07:06:22Z","timestamp":1303110382000},"page":"559-578","source":"Crossref","is-referenced-by-count":24,"title":["Homogeneous Formulas and Symmetric Polynomials"],"prefix":"10.1007","volume":"20","author":[{"given":"Pavel","family":"Hrube\u0161","sequence":"first","affiliation":[]},{"given":"Amir","family":"Yehudayoff","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,4,19]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"J. Friedman (1984). Constructing O(n log n) size monotone formulae for the k\u2013th elementary symmetric polynomial of n Boolean variables. In Proceedings of the 25th FOCS, 506\u2013515.","DOI":"10.1109\/SFCS.1984.715953"},{"key":"7_CR2","first-page":"6037","volume":"258","author":"G. Hansel","year":"1964","unstructured":"Hansel G. (1964) Nombre minimal de contacts de fermeture n\u00e9cessaire pour r\u00e9aliser une function Bool\u00e9enne symm\u00e9triques de n variables. C. R. Acad. Sci. Paris 258: 6037\u20136040","journal-title":"C. R. Acad. Sci. Paris"},{"issue":"2","key":"7_CR3","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1137\/0208010","volume":"8","author":"L. Hyafil","year":"1979","unstructured":"Hyafil L. (1979) On the parallel evaluation of multivariate polynomials. SIAM J. Comput. 8(2): 120\u2013123","journal-title":"SIAM J. Comput."},{"key":"7_CR4","first-page":"1149","volume":"14","author":"L.S. Khasin","year":"1970","unstructured":"Khasin L.S. (1970) Complexity bounds for the realization of monotone symmetrical functions by means of formulas in the basis +,*,-. Sov. Phys. Dokl. 14: 1149\u20131151","journal-title":"Sov. Phys. Dokl."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"N. Nisan (1991). Lower bounds for non-commutative computation. In Proceeding of the 23th STOC, 410\u2013418.","DOI":"10.1145\/103418.103462"},{"key":"7_CR6","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF01294256","volume":"6","author":"N. Nisan","year":"1996","unstructured":"Nisan N., Wigderson A. (1996) Lower bounds on arithmetic circuits via partial derivatives. Computational Complexity 6: 217\u2013234","journal-title":"Computational Complexity"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"R. Raz (2004). Multi-linear formulas for Permanent and Determinant are of super-polynomial size. In Proceeding of the 36th STOC, 633\u2013641.","DOI":"10.1145\/1007352.1007353"},{"key":"7_CR8","unstructured":"R. Raz (2009). Tensor rank and lower bounds on arithmetic formulas. Manuscript."},{"issue":"1","key":"7_CR9","first-page":"301","volume":"13","author":"E. Shamir","year":"1979","unstructured":"Shamir E., Snir M. (1979) On the depth complexity of formulas. Journal Theory of Computing Systems 13(1): 301\u2013322","journal-title":"Journal Theory of Computing Systems"},{"issue":"1","key":"7_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/PL00001609","volume":"10","author":"A. Shpilka","year":"2001","unstructured":"Shpilka A., Wigderson A. (2001) Depth-3 arithmetic formulae over fields of characteristic zero. Journal of Computational Complexity 10(1): 1\u201327","journal-title":"Journal of Computational Complexity"},{"key":"7_CR11","first-page":"182","volume":"264","author":"V. Strassen","year":"1973","unstructured":"Strassen V. (1973) Vermeidung von Divisionen. J. of Reine Angew. Math. 264: 182\u2013202","journal-title":"J. of Reine Angew. Math."}],"container-title":["computational complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-011-0007-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00037-011-0007-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00037-011-0007-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T03:37:07Z","timestamp":1560137827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00037-011-0007-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,19]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["7"],"URL":"https:\/\/doi.org\/10.1007\/s00037-011-0007-3","relation":{},"ISSN":["1016-3328","1420-8954"],"issn-type":[{"value":"1016-3328","type":"print"},{"value":"1420-8954","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,19]]}}}