{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T20:16:23Z","timestamp":1781208983480,"version":"3.54.1"},"reference-count":43,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2020,9,1]],"date-time":"2020-09-01T00:00:00Z","timestamp":1598918400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2020,9]]},"abstract":"<jats:p>\n            Let\n            <jats:italic>p<\/jats:italic>\n            be a prime of the form\n            <jats:italic>p<\/jats:italic>\n            = \u03c32\n            <jats:sup>\n              <jats:italic>k<\/jats:italic>\n            <\/jats:sup>\n            + 1 with \u03c3 small and let F\n            <jats:sub>\n              <jats:italic>p<\/jats:italic>\n            <\/jats:sub>\n            denote the finite field with\n            <jats:italic>p<\/jats:italic>\n            elements. Let\n            <jats:italic>P<\/jats:italic>\n            (\n            <jats:italic>z<\/jats:italic>\n            ) be a polynomial of degree\n            <jats:italic>d<\/jats:italic>\n            in F\n            <jats:sub>\n              <jats:italic>p<\/jats:italic>\n            <\/jats:sub>\n            [\n            <jats:italic>z<\/jats:italic>\n            ] with\n            <jats:italic>d<\/jats:italic>\n            distinct roots in F\n            <jats:sub>\n              <jats:italic>p<\/jats:italic>\n            <\/jats:sub>\n            . For\n            <jats:italic>p<\/jats:italic>\n            =5 \u00b7 2\n            <jats:sup>55<\/jats:sup>\n            + 1 we can compute the roots of such polynomials of degree 10\n            <jats:sup>9<\/jats:sup>\n            . We believe we are the first to factor such polynomials of size one billion. We used a multi-core computer with two 10 core Intel Xeon E5 2680 v2 CPUs and 128 gigabytes of RAM. The factorization takes just under 4,000 seconds on 10 cores and uses 121 gigabytes of RAM.\n          <\/jats:p>\n          <jats:p>\n            We used the tangent Graeffe root finding algorithm from [27, 19] which is a factor of\n            <jats:italic>O<\/jats:italic>\n            (log\n            <jats:italic>d<\/jats:italic>\n            ) faster than the Cantor-Zassenhaus algorithm. We implemented the tangent Graeffe algorithm in C using our own library of 64 bit integer FFT based in-place polynomial algorithms then parallelized the FFT and main steps using Cilk C.\n          <\/jats:p>\n          <jats:p>\n            In this article we discuss the steps of the tangent Graeffe algorithm, the sub-algorithms that we used, how we parallelized them, and how we organized the memory so we could factor a polynomial of degree 10\n            <jats:sup>9<\/jats:sup>\n            . We give both a theoretical and practical comparison of the tangent Graeffe algorithm with the Cantor-Zassenhaus algorithm for root finding. We improve the complexity of the tangent Graeffe algorithm by a factor of 2. We present a new in-place product tree multiplication algorithm that is fully parallelizable. We present some timings comparing our software with Magma's polynomial factorization command.\n          <\/jats:p>\n          <jats:p>Polynomial root finding over smooth finite fields is a key ingredient for algorithms for sparse polynomial interpolation that are based on geometric sequences. This application was also one of our main motivations for the present work.<\/jats:p>","DOI":"10.1145\/3457341.3457342","type":"journal-article","created":{"date-parts":[[2021,3,15]],"date-time":"2021-03-15T22:07:02Z","timestamp":1615846022000},"page":"65-85","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Computing one billion roots using the tangent Graeffe method"],"prefix":"10.1145","volume":"54","author":[{"given":"Joris","family":"van der Hoeven","sequence":"first","affiliation":[{"name":"CNRS, \u00c9cole polytechnique, Palaiseau, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael","family":"Monagan","sequence":"additional","affiliation":[{"name":"Simon Fraser University, Burnaby, British Columbia, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,3,15]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/0204045"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62241"},{"key":"e_1_2_1_3_1","first-page":"325","volume-title":"Fast multiplication and its applications","author":"Bernstein D.J.","year":"2008","unstructured":"D.J. Bernstein . Fast multiplication and its applications , pages 325 -- 384 . Mathematical Sciences Research Institute Publications. Cambridge University Press , United Kingdom, 2008 . D.J. Bernstein. Fast multiplication and its applications, pages 325--384. Mathematical Sciences Research Institute Publications. Cambridge University Press, United Kingdom, 2008."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAU.1970.1162132"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/860854.860870"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(80)90013-9"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/74540.74556"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1981-0606517-5"},{"key":"e_1_2_1_9_1","series-title":"Computational Mathematics Series","volume-title":"Inside the FFT Black Box","author":"Chu E.","year":"2000","unstructured":"E. Chu and A. George . Inside the FFT Black Box . Computational Mathematics Series . CRC Press , 2000 . E. Chu and A. George. Inside the FFT Black Box. Computational Mathematics Series. CRC Press, 2000."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/134463"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/281508.281538"},{"key":"e_1_2_1_12_1","first-page":"11571","article-title":"High performance SIMD modular arithmetic for polynomial evaluation","author":"Fortin P.","year":"2004","unstructured":"P. Fortin , A. Fleury , F. Lemaire , and M. Monagan . High performance SIMD modular arithmetic for polynomial evaluation . ArXiv : 2004 . 11571 , 2020. P. Fortin, A. Fleury, F. Lemaire, and M. Monagan. High performance SIMD modular arithmetic for polynomial evaluation. ArXiv:2004.11571, 2020.","journal-title":"ArXiv"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2009.934155"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/44128.214376"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840301"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/277652.277725"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/2512973"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755996.2756647"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-015-0280-5"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2013.09.002"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005285.1005327"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2012.06.004"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2733693.2733721"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2876503"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-52200-1_48"},{"key":"e_1_2_1_28_1","volume-title":"GNU TeXmacs. https:\/\/www.texmacs.org","author":"van der Hoeven J.","year":"1998","unstructured":"J. van der Hoeven GNU TeXmacs. https:\/\/www.texmacs.org , 1998 . J. van der Hoeven et al. GNU TeXmacs. https:\/\/www.texmacs.org, 1998."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2930889.2930903"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/313852.314110"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/1837210.1837233"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22160"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/96877.96912"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80015-6"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/646361.690740"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087604.3087636"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/800125.804045"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.143"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0020"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1971-0301966-0"},{"key":"e_1_2_1_41_1","unstructured":"R. Prony. Essai exp\u00e9rimental et analytique sur les lois de la dilatabilit\u00e9 des fluides \u00e9lastiques et sur celles de la force expansive de la vapeur de l'eau et de la vapeur de l'alkool \u00e0 diff\u00e9rentes temp\u00e9ratures. J. de l'\u00c9cole Polytechnique Flor\u00e9al et Plairial an III 1(cahier 22):24--76 1795.  R. Prony. Essai exp\u00e9rimental et analytique sur les lois de la dilatabilit\u00e9 des fluides \u00e9lastiques et sur celles de la force expansive de la vapeur de l'eau et de la vapeur de l'alkool \u00e0 diff\u00e9rentes temp\u00e9ratures. J. de l'\u00c9cole Polytechnique Flor\u00e9al et Plairial an III 1(cahier 22):24--76 1795."},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840306"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/3208976.3209027"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1995.1055"},{"key":"e_1_2_1_45_1","unstructured":"A. Steel. Private communication.  A. Steel. Private communication."}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3457341.3457342","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3457341.3457342","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:19Z","timestamp":1750191439000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3457341.3457342"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["10.1145\/3457341.3457342"],"URL":"https:\/\/doi.org\/10.1145\/3457341.3457342","relation":{},"ISSN":["1932-2240"],"issn-type":[{"value":"1932-2240","type":"print"}],"subject":[],"published":{"date-parts":[[2020,9]]},"assertion":[{"value":"2021-03-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}