{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:04Z","timestamp":1725663064793},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540167617"},{"type":"electronic","value":"9783540398592"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16761-7_52","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:52:21Z","timestamp":1330195941000},"page":"31-39","source":"Crossref","is-referenced-by-count":0,"title":["Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial"],"prefix":"10.1007","author":[{"given":"Amir","family":"Averbuch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shmuel","family":"Winograd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zvi","family":"Galil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0304-3975(79)90017-3","volume":"8","author":"S. Winograd","year":"1979","unstructured":"S. Winograd, \"On multiplication in algebraic extension fields\", Theoret. Comput. Sci., 8(1979), pp. 359\u2013377","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF01683270","volume":"10","author":"S. Winograd","year":"1977","unstructured":"\u2014, \"Some bilinear forms whose multiplicative complexity depends on the field of constants\", Math. Syst. Theory, Vol 10 (1977), pp. 169\u2013180","journal-title":"Math. Syst. Theory"},{"key":"4_CR3","unstructured":"-, \"Arithmetic Complexity of Computations\", SIAM 1980"},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/cpa.3160230204","volume":"23","author":"S. Winograd","year":"1970","unstructured":"\u2014, \"On the number of multiplications necessary to compute certain functions\", Comm. Pure Appl. Math. 23 (1970), pp. 165\u2013179","journal-title":"Comm. Pure Appl. Math."},{"key":"4_CR5","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0001-8708(79)90037-9","volume":"32","author":"S. Winograd","year":"1979","unstructured":"\u2014, \"On the multiplicative complexity of the Discrete Fourier Transform\", Advances in Math., 32 (1979), pp. 83\u2013117","journal-title":"Advances in Math."},{"key":"4_CR6","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1090\/S0025-5718-1978-0468306-4","volume":"32","author":"S. Winograd","year":"1978","unstructured":"\u2014, \"On computing the Discrete Fourier Transform\", Math.Comput., vol. 32,pp.175\u2013199,1978","journal-title":"Math.Comput."},{"key":"4_CR7","first-page":"714","volume":"4","author":"A.L. Toom","year":"1963","unstructured":"A.L. Toom, \"The complexity of schemes of functional elements\", Soviet Math. Dokl., 4 (1963), pp. 714\u2013716","journal-title":"Soviet Math. Dokl."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"C.M. Fiduccia, Y. Zalcstein, \"Algebras having linear multiplicative complexities\", J. of ACM, Vol. 24, No. 2, April 1977","DOI":"10.1145\/322003.322014"},{"key":"4_CR9","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0196-6774(81)90026-2","volume":"2","author":"E. Feig","year":"1981","unstructured":"E. Feig, \"On Systems of Bilinear Forms Whose Minimal Divison-Free Algorithms Are All Bilinear\", J. of Algorithms 2,261\u2013281 (1981)","journal-title":"J. of Algorithms"},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0196-6774(83)90041-X","volume":"4","author":"E. Feig","year":"1983","unstructured":"E. Feig, \"Certain Systems of Bilinear Forms Whose Minimal Algorithms Are All Quadratic\", J. of Algorithms 4,137\u2013149 (1983)","journal-title":"J. of Algorithms"},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(78)90038-5","volume":"7","author":"H.F. Groote de","year":"1978","unstructured":"H.F. de Groote, \"On Varieties of optimal algorithms for the computation of bilinear mappings I. The isotropy group of bilinear mapping\", Theoret. Comput. Sci., 7(1978), pp. 1\u201324","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR12","first-page":"124","volume":"7","author":"H.F. Groote de","year":"1978","unstructured":"\u2014, \"On Varieties of optimal algorithms for the computation of bilinear mappings II. Optimal algorithms for 2 \u00d7 2 matrix multiplication\", Theoret. Comput. Sci., 7(1978), pp. 124\u2013148","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR13","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0304-3975(78)90015-4","volume":"7","author":"H.F. Groote de","year":"1978","unstructured":"\u2014, \"On Varieties of optimal algorithms for the computation of bilinear mappings III. Optimal algorithms for the computation of xy and yx where x,y\u03b5M 2(K)\", Theoret. Comput. Sci., 7(1978), pp. 239\u2013249","journal-title":"Theoret. Comput. Sci."},{"key":"4_CR14","unstructured":"A.Averbuch, Z.Galil, S.Winograd, \"Classification of all the minimal bilinear algorithms for computing the coefficients of two polynomials in the algebra G[u]\/ \u2329Q(u) l \u232a l > 1\", to appear"},{"key":"4_CR15","unstructured":"A.Averbuch, Z.Galil, S.Winograd, \"Classification of all the minimal bilinear algorithms for computing the coefficients of two polynomials in the algebra G[u]\/ \u2329u u \u232a\", to appear"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"A.Fellman, \"Optimal algorithms for the multiplication in simply generated local algebras\", Universitat Frankfurt, 1985.","DOI":"10.1007\/3-540-16776-5_731"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16761-7_52.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:05:05Z","timestamp":1619557505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16761-7_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167617","9783540398592"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-16761-7_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]}}}