{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:47:14Z","timestamp":1725490034308},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735441"},{"type":"electronic","value":"9783540735458"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73545-8_46","type":"book-chapter","created":{"date-parts":[[2007,8,17]],"date-time":"2007-08-17T13:44:11Z","timestamp":1187358251000},"page":"470-481","source":"Crossref","is-referenced-by-count":0,"title":["\u201cResistant\u201d Polynomials and Stronger Lower Bounds for Depth-Three Arithmetical Formulas"],"prefix":"10.1007","author":[{"given":"Maurice J.","family":"Jansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth W.","family":"Regan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"46_CR1","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0304-3975(83)90110-X","volume":"22","author":"W. Baur","year":"1982","unstructured":"Baur, W., Strassen, V.: The complexity of partial derivatives. Theor. Comp. Sci.\u00a022, 317\u2013330 (1982)","journal-title":"Theor. Comp. Sci."},{"key":"46_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03338-8","volume-title":"Algebraic Complexity Theory","author":"P. B\u00fcrgisser","year":"1997","unstructured":"B\u00fcrgisser, P., Clausen, M., Shokrollahi, M.A.: Algebraic Complexity Theory. Springer, Heidelberg (1997)"},{"key":"46_CR3","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF01744431","volume":"17","author":"M. Furst","year":"1984","unstructured":"Furst, M., Saxe, J., Sipser, M.: Parity, circuits, and the polynomial-time hierarchy. Math. Sys. Thy.\u00a017, 13\u201327 (1984)","journal-title":"Math. Sys. Thy."},{"key":"46_CR4","unstructured":"Greuel, G.-M., Pfister, G., Sch\u00f6nemann, H.: Singular 3.0. A Computer Algebra System for Polynomial Computations, Centre for Computer Algebra, University of Kaiserslautern (2005), \n                  \n                    http:\/\/www.singular.uni-kl.de"},{"key":"46_CR5","first-page":"577","volume-title":"Proc. 30th Annual ACM Symposium on the Theory of Computing","author":"D. Grigoriev","year":"1998","unstructured":"Grigoriev, D., Karpinski, M.: An exponential lower bound for depth 3 arithmetic circuits. In: Proc. 30th Annual ACM Symposium on the Theory of Computing, pp. 577\u2013582. ACM Press, New York (1998)"},{"key":"46_CR6","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s002009900021","volume":"10","author":"D. Grigoriev","year":"1998","unstructured":"Grigoriev, D., Razborov, A.A.: Exponential lower bounds for depth 3 algebraic circuits in algebras of functions over finite fields. Applicable Algebra in Engineering, Communication, and Computing\u00a010, 465\u2013487 (1998) (preliminary version FOCS 1998)","journal-title":"Applicable Algebra in Engineering, Communication, and Computing"},{"key":"46_CR7","series-title":"Advances in Computing Research","first-page":"143","volume-title":"Randomness and Computation","author":"J. H\u00e5stad","year":"1989","unstructured":"H\u00e5stad, J.: Almost optimal lower bounds for small-depth circuits. In: Micali, S. (ed.) Randomness and Computation. Advances in Computing Research, vol.\u00a05, pp. 143\u2013170. JAI Press, Greenwich, CT (1989)"},{"key":"46_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF01294256","volume":"6","author":"N. Nisan","year":"1996","unstructured":"Nisan, N., Wigderson, A.: Lower bounds on arithmetic circuits via partial derivatives. Computational Complexity\u00a06, 217\u2013234 (1996)","journal-title":"Computational Complexity"},{"key":"46_CR9","doi-asserted-by":"publisher","first-page":"639","DOI":"10.1016\/S0022-0000(02)00021-1","volume":"65","author":"A. Shpilka","year":"2002","unstructured":"Shpilka, A.: Affine projections of symmetric polynomials. J. Comp. Sys. Sci.\u00a065, 639\u2013659 (2002)","journal-title":"J. Comp. Sys. Sci."},{"key":"46_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00001609","volume":"10","author":"A. Shpilka","year":"2001","unstructured":"Shpilka, A., Wigderson, A.: Depth-3 arithmetic formulae over fields of characteristic zero. Computational Complexity\u00a010, 1\u201327 (2001)","journal-title":"Computational Complexity"},{"key":"46_CR11","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/BF00571464","volume":"2","author":"V. Strassen","year":"1973","unstructured":"Strassen, V.: Berechnung und Programm II. Acta Informatica\u00a02, 64\u201379 (1973)","journal-title":"Acta Informatica"},{"key":"46_CR12","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L. Valiant","year":"1979","unstructured":"Valiant, L.: The complexity of computing the permanent. Theor. Comp. Sci.\u00a08, 189\u2013201 (1979)","journal-title":"Theor. Comp. Sci."},{"key":"46_CR13","first-page":"1","volume-title":"Proc. 26th Annual IEEE Symposium on Foundations of Computer Science","author":"A. Yao","year":"1985","unstructured":"Yao, A.: Separating the polynomial-time hierarchy by oracles. In: Proc. 26th Annual IEEE Symposium on Foundations of Computer Science, pp. 1\u201310. IEEE Computer Society Press, Los Alamitos (1985)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73545-8_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:18:00Z","timestamp":1619518680000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73545-8_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735441","9783540735458"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73545-8_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}