{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:55:01Z","timestamp":1742990101877,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642207112"},{"type":"electronic","value":"9783642207129"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-20712-9_8","type":"book-chapter","created":{"date-parts":[[2011,6,11]],"date-time":"2011-06-11T00:05:22Z","timestamp":1307750722000},"page":"91-104","source":"Crossref","is-referenced-by-count":3,"title":["Faster Polynomial Multiplication via Discrete Fourier Transforms"],"prefix":"10.1007","author":[{"given":"Alexey","family":"Pospelov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Bach, E., Shallit, J.: Algorithmic Number Theory, Cambridge, MA, vol.\u00a01 (1996)"},{"key":"8_CR2","unstructured":"Bl\u00e4ser, M.: Private communication (2010)"},{"key":"8_CR3","doi-asserted-by":"publisher","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, A.: Algebraic Complexity Theory. Springer, Berlin (1997)"},{"issue":"3","key":"8_CR4","first-page":"464","volume":"51","author":"P. B\u00fcrgisser","year":"2004","unstructured":"B\u00fcrgisser, P., Lotz, M.: Lower bounds on the bounded coefficient complexity of bilinear maps. J.\u00a0ACM\u00a051(3), 464\u2013482 (2004)","journal-title":"J.\u00a0ACM"},{"key":"8_CR5","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, 693\u2013701 (1991)","journal-title":"Acta Informatica"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0885-064X(88)90012-X","volume":"4","author":"D. Chudnovsky","year":"1988","unstructured":"Chudnovsky, D., Chudnovsky, G.: Algebraic complexities and algebraic curves over finite fields. Journal of Complexity\u00a04, 285\u2013316 (1988)","journal-title":"Journal of Complexity"},{"key":"8_CR7","unstructured":"Clausen, M., Baum, U.: Fast Fourier Transforms. Wissenschaftsverlag Mannheim-Leipzig-Wien-Z\u00fcrich (1993)"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"J.W. Cooley","year":"1965","unstructured":"Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series. Math. Comput.\u00a019, 297\u2013301 (1965)","journal-title":"Math. Comput."},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"De, A., Kurur, P.P., Saha, C., Saptharishi, R.: Fast integer multiplication using modular arithmetic. In: Proceedings of the 40th ACM STOC 2008 Conference, pp. 499\u2013506 (2008)","DOI":"10.1145\/1374376.1374447"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"F\u00fcrer, M.: Faster Integer Multiplication. In: Proceedings of the 39th ACM STOC 2007 Conference, pp. 57\u201366 (2007)","DOI":"10.1145\/1250790.1250800"},{"key":"8_CR11","volume-title":"Modern Computer Algebra","author":"J. zur Gathen von","year":"2003","unstructured":"von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 2nd edn. Cambridge University Press, New York (2003)","edition":"2"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0196-6774(88)90010-7","volume":"9","author":"M. Kaminski","year":"1988","unstructured":"Kaminski, M.: An algorithm for polynomial multiplication that does not depend on the ring of constants. J.\u00a0Algorithms\u00a09, 137\u2013147 (1988)","journal-title":"J.\u00a0Algorithms"},{"key":"8_CR13","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/jsco.1994.1042","volume":"18","author":"V.Y. Pan","year":"1994","unstructured":"Pan, V.Y.: Simple Multivariate Polynomial Multiplication. J.\u00a0Symbolic Computation\u00a018, 183\u2013186 (1994)","journal-title":"J.\u00a0Symbolic Computation"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1109\/PROC.1968.6477","volume":"56","author":"C.M. Rader","year":"1968","unstructured":"Rader, C.M.: Discrete Fourier transforms when the number of data samples is prime. Proc. IEEE\u00a056, 1107\u20131108 (1968)","journal-title":"Proc. IEEE"},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/BF00289470","volume":"7","author":"A. Sch\u00f6nhage","year":"1977","unstructured":"Sch\u00f6nhage, A.: Schnelle Multiplikation von Polynomen \u00fcber K\u00f6rpern der Charakteristic 2. Acta Informatica\u00a07, 395\u2013398 (1977)","journal-title":"Acta Informatica"},{"key":"8_CR16","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":"8_CR17","first-page":"145","volume-title":"Lecture Notes in Math.","author":"I.E. Shparlinski","year":"1992","unstructured":"Shparlinski, I.E., Tsfasman, M.A., Vladut, S.G.: Curves with many points and multiplication in finite fields. In: Lecture Notes in Math., vol.\u00a01518, pp. 145\u2013169. Springer, Berlin (1992)"},{"key":"8_CR18","first-page":"184","volume":"264","author":"V. Strassen","year":"1973","unstructured":"Strassen, V.: Vermeidung von Divisionen. Crelles J.\u00a0Reine Angew. Math.\u00a0264, 184\u2013202 (1973)","journal-title":"Crelles J.\u00a0Reine Angew. Math."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20712-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,28]],"date-time":"2019-03-28T12:40:15Z","timestamp":1553776815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20712-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642207112","9783642207129"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20712-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}