{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:32:44Z","timestamp":1742949164968,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041020"},{"type":"electronic","value":"9783642041037"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04103-7_6","type":"book-chapter","created":{"date-parts":[[2009,9,30]],"date-time":"2009-09-30T01:41:17Z","timestamp":1254274877000},"page":"66-78","source":"Crossref","is-referenced-by-count":0,"title":["Code Generation for Polynomial Multiplication"],"prefix":"10.1007","author":[{"given":"Ling","family":"Ding","sequence":"first","affiliation":[]},{"given":"\u00c9ric","family":"Schost","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","first-page":"17","volume-title":"ISSAC 2007","author":"M. Bodrato","year":"2007","unstructured":"Bodrato, M., Zanoni, A.: Integer and polynomial multiplication: towards optimal Toom-Cook matrices. In: ISSAC 2007, pp. 17\u201324. ACM, New York (2007)"},{"issue":"3-4","key":"6_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W. Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symbolic Comput.\u00a024(3-4), 235\u2013265 (1997)","journal-title":"J. Symbolic Comput."},{"key":"6_CR3","first-page":"37","volume-title":"ISSAC 2003","author":"A. Bostan","year":"2003","unstructured":"Bostan, A., Lecerf, G., Schost, \u00c9.: Tellegen\u2019s principle into practice. In: ISSAC 2003, pp. 37\u201344. ACM, New York (2003)"},{"issue":"4","key":"6_CR4","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1145\/322092.322099","volume":"25","author":"R.P. Brent","year":"1978","unstructured":"Brent, R.P., Kung, H.T.: Fast algorithms for manipulating formal power series. J. ACM\u00a025(4), 581\u2013595 (1978)","journal-title":"J. ACM"},{"key":"6_CR5","series-title":"Grund. Math. Wissen","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. Grund. Math. Wissen, vol.\u00a0315. Springer, Heidelberg (1997)"},{"issue":"7","key":"6_CR6","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/BF01178683","volume":"28","author":"D.G. Cantor","year":"1991","unstructured":"Cantor, D.G., Kaltofen, E.: On fast multiplication of polynomials over arbitrary algebras. Acta Informatica\u00a028(7), 693\u2013701 (1991)","journal-title":"Acta Informatica"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Cooley, J., Tukey, J.: An algorithm for the machine calculation of complex Fourier series. Mathematics of computation\u00a019 (1965)","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"key":"6_CR8","unstructured":"Gaudry, P., Thom\u00e9, E.: The mpFq library and implementing curve-based key exchanges. In: SPEED, pp. 49\u201364 (2007)"},{"issue":"6","key":"6_CR9","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/s00200-003-0144-2","volume":"14","author":"G. Hanrot","year":"2004","unstructured":"Hanrot, G., Quercia, M., Zimmermann, P.: The middle product algorithm. I. Appl. Algebra Engrg. Comm. Comput.\u00a014(6), 415\u2013438 (2004)","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/j.jsc.2003.03.001","volume":"37","author":"G. Hanrot","year":"2004","unstructured":"Hanrot, G., Zimmermann, P.: A long note on Mulders\u2019 short product. J. Symb. Comput.\u00a037(3), 391\u2013401 (2004)","journal-title":"J. Symb. Comput."},{"key":"6_CR11","first-page":"595","volume":"7","author":"A. Karatsuba","year":"1963","unstructured":"Karatsuba, A., Ofman, Y.: Multiplication of multidigit numbers on automata. Soviet Math. Dokl.\u00a07, 595\u2013596 (1963)","journal-title":"Soviet Math. Dokl."},{"key":"6_CR12","volume-title":"ISSAC 2009","author":"M. Monagan","year":"2009","unstructured":"Monagan, M., Pearce, R.: Parallel sparse polynomial multiplication using heaps. In: ISSAC 2009. ACM, New York (to appear, 2009)"},{"issue":"170","key":"6_CR13","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P.L. Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Mathematics of Computation\u00a044(170), 519\u2013521 (1985)","journal-title":"Mathematics of Computation"},{"issue":"1","key":"6_CR14","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s002000000037","volume":"11","author":"T. Mulders","year":"2000","unstructured":"Mulders, T.: On short multiplications and divisions. Appl. Algebra Engrg. Comm. Comput.\u00a011(1), 69\u201388 (2000)","journal-title":"Appl. Algebra Engrg. Comm. Comput."},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A., Strassen, V.: Schnelle Multiplikation gro\u00dfer Zahlen. Computing\u00a07, 281\u2013292 (1971)","journal-title":"Computing"},{"key":"6_CR16","unstructured":"Shoup, V.: A library for doing number theory, \n                  \n                    http:\/\/www.shoup.net\/ntl\/"},{"issue":"4","key":"6_CR17","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1006\/jsco.1995.1055","volume":"20","author":"V. Shoup","year":"1995","unstructured":"Shoup, V.: A new polynomial factorization algorithm and its implementation. J. Symb. Comp.\u00a020(4), 363\u2013397 (1995)","journal-title":"J. Symb. Comp."},{"issue":"3","key":"6_CR18","first-page":"496","volume":"150","author":"A. Toom","year":"1963","unstructured":"Toom, A.: The complexity of a scheme of functional elements realizing the multiplication of integers. Doklady Akad. Nauk USSR\u00a0150(3), 496\u2013498 (1963)","journal-title":"Doklady Akad. Nauk USSR"},{"issue":"6","key":"6_CR19","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1006\/jsco.2002.0562","volume":"34","author":"J. Hoeven van der","year":"2002","unstructured":"van der Hoeven, J.: Relax, but don\u2019t be too lazy. J. Symbolic Comput.\u00a034(6), 479\u2013542 (2002)","journal-title":"J. Symbolic Comput."},{"key":"6_CR20","volume-title":"Modern computer algebra","author":"J. Gathen von zur","year":"2003","unstructured":"von zur Gathen, J., Gerhard, J.: Modern computer algebra, 2nd edn. Cambridge University Press, Cambridge (2003)","edition":"2"},{"key":"6_CR21","volume-title":"CBMS-NSF Regional Conference Series in Applied Mathematics","author":"S. Winograd","year":"1980","unstructured":"Winograd, S.: Arithmetic complexity of computations. In: CBMS-NSF Regional Conference Series in Applied Mathematics, vol.\u00a033. SIAM, Philadelphia (1980)"},{"key":"6_CR22","unstructured":"Zimmermann, P.: Irred-ntl patch, \n                  \n                    http:\/\/www.loria.fr\/~zimmerma\/irred\/"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04103-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T20:54:20Z","timestamp":1552164860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04103-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041020","9783642041037"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04103-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}