{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T10:27:17Z","timestamp":1758709637770,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T00:00:00Z","timestamp":1690156800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Natural Science Foundation of China","award":["12288201"],"award-info":[{"award-number":["12288201"]}]},{"name":"Natural Science Foundation of China","award":["12001321"],"award-info":[{"award-number":["12001321"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,24]]},"DOI":"10.1145\/3597066.3597087","type":"proceedings-article","created":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T18:15:27Z","timestamp":1688580927000},"page":"315-324","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["New Sparse Multivariate Polynomial Factorization Algorithms over Integers"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-1596-5863","authenticated-orcid":false,"given":"Qiao-Long","family":"Huang","sequence":"first","affiliation":[{"name":"School of Mathematics, Shandong University, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2021-9395","authenticated-orcid":false,"given":"Xiao-Shan","family":"Gao","sequence":"additional","affiliation":[{"name":"KLMM, UCAS, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62241"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1967.tb03174.x"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1970-0276200-X"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3365667"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005285.1005294"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1981-0606517-5"},{"volume-title":"Transcendental and algebraic numbers","author":"Gelfond Aleksandr\u00a0Osipovich","key":"e_1_3_2_1_7_1","unstructured":"Aleksandr\u00a0Osipovich Gelfond. 2015. Transcendental and algebraic numbers. Courier Dover Publications."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802200"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.56"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1985.17"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Erich Kaltofen. 1985. Effective Hilbert irreducibility. In Information and Control. Citeseer.","DOI":"10.1016\/S0019-9958(85)80056-5"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214035"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Erich Kaltofen. 1985. Sparse Hensel lifting. In Research Contributions from the European Conference on Computer Algebra.","DOI":"10.1007\/3-540-15984-3_230"},{"key":"e_1_3_2_1_14_1","first-page":"375","article-title":"Factorization of polynomials given by straight-line programs","volume":"5","author":"Kaltofen Erich","year":"1989","unstructured":"Erich Kaltofen. 1989. Factorization of polynomials given by straight-line programs.Adv. Comput. Res. 5 (1989), 375\u2013412.","journal-title":"Adv. Comput. Res."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225166"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"E. Kaltofen and B. Trager. 1988. Computing with polynomials given by black boxes for their evaluations: greatest common divisors factorization separation of numerators and denominators. In [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science. 296\u2013305.","DOI":"10.1109\/SFCS.1988.21946"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80015-6"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22160"},{"key":"e_1_3_2_1_19_1","volume-title":"Proceedings of the 23rd Annual ACM Symposium on Theory of Computing","author":"Kaltofen L.","year":"1991","unstructured":"Erich\u00a0L. Kaltofen. 1991. Effective Noether irreducibility forms and applications (Extended Abstract). In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, May 5-8, 1991, New Orleans, Louisiana, USA, Cris Koutsougeras and Jeffrey\u00a0Scott Vitter (Eds.). ACM, 54\u201363."},{"volume-title":"International Symposium ISSAC 2005, Beijing, China, July 24-27, 2005, Proceedings, Manuel Kauers (Ed.). ACM, 208\u2013215","author":"L.","key":"e_1_3_2_1_20_1","unstructured":"Erich\u00a0L. Kaltofen and Pascal Koiran. 2005. On the complexity of factoring bivariate supersparse (Lacunary) polynomials. In Symbolic and Algebraic Computation, International Symposium ISSAC 2005, Beijing, China, July 24-27, 2005, Proceedings, Manuel Kauers (Ed.). ACM, 208\u2013215."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/08073408X"},{"key":"e_1_3_2_1_22_1","volume-title":"Factoring polynomials with rational coefficients. Mathematische annalen 261","author":"Lenstra K","year":"1982","unstructured":"Arjen\u00a0K Lenstra, Hendrik\u00a0Willem Lenstra, and L\u00e1szl\u00f3 Lov\u00e1sz. 1982. Factoring polynomials with rational coefficients. Mathematische annalen 261 (1982), 515\u2013534."},{"key":"e_1_3_2_1_23_1","volume-title":"Proc. CASC\u201916","author":"B.","year":"2016","unstructured":"Michael\u00a0B. Monagan and Baris Tuncer. 2016. Using sparse interpolation in Hensel lifting. In Proc. CASC\u201916, Bucharest, Romania, September 19-23, 2016(Lecture Notes in Computer Science, Vol.\u00a09890). Springer, 381\u2013400."},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. CASC\u201918","author":"B.","year":"2018","unstructured":"Michael\u00a0B. Monagan and Baris Tuncer. 2018. Factoring multivariate polynomials with many factors and huge coefficients. In Proc. CASC\u201918, Lille, France, September 17-21, 2018(Lecture Notes in Computer Science, Vol.\u00a011077). Springer, 319\u2013334."},{"key":"e_1_3_2_1_25_1","volume-title":"Monagan and Baris Tuncer","author":"B.","year":"2019","unstructured":"Michael\u00a0B. Monagan and Baris Tuncer. 2019. Polynomial factorization in Maple 2019. In Maple in Mathematics Education and Research - Third Maple Conference, MC 2019, Waterloo, Ontario, Canada, October 15-17, 2019, Proceedings(Communications in Computer and Information Science, Vol.\u00a01125), J\u00fcrgen Gerhard and Ilias\u00a0S. Kotsireas (Eds.). Springer, 341\u2013345."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2019.05.001"},{"key":"e_1_3_2_1_27_1","volume-title":"Factors of low individual degree polynomials. Computational Complexity 25, 2","author":"Oliveira R.","year":"2016","unstructured":"R. Oliveira. 2016. Factors of low individual degree polynomials. Computational Complexity 25, 2 (2016)."},{"key":"e_1_3_2_1_28_1","volume-title":"LIPIcs - Leibniz International Proceedings in Informatics","author":"Volkovich Ilya","year":"2015","unstructured":"Ilya Volkovich. 2015. Deterministically factoring sparse polynomials into multilinear factors and sums of univariate polynomials. LIPIcs - Leibniz International Proceedings in Informatics (2015)."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.15"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90043-1"},{"volume-title":"Modern Computer Algebra (3. ed.)","author":"von\u00a0zur Gathen Joachim","key":"e_1_3_2_1_31_1","unstructured":"Joachim von\u00a0zur Gathen and J\u00fcrgen Gerhard. 2013. Modern Computer Algebra (3. ed.). Cambridge University Press."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90044-3"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01272074"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1978-0568284-3"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1975-0396471-3"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-314X(69)90047-X"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-09519-5_73"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/800206.806372"},{"volume-title":"Effective polynomial computation","author":"Zippel Richard","key":"e_1_3_2_1_39_1","unstructured":"Richard Zippel. 1993. Effective polynomial computation. The Kluwer international series in engineering and computer science, Vol.\u00a0241. Kluwer."}],"event":{"name":"ISSAC 2023: International Symposium on Symbolic and Algebraic Computation 2023","acronym":"ISSAC 2023","location":"Troms\u00f8 Norway"},"container-title":["Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3597066.3597087","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3597066.3597087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T09:36:08Z","timestamp":1755855368000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3597066.3597087"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,24]]},"references-count":39,"alternative-id":["10.1145\/3597066.3597087","10.1145\/3597066"],"URL":"https:\/\/doi.org\/10.1145\/3597066.3597087","relation":{},"subject":[],"published":{"date-parts":[[2023,7,24]]},"assertion":[{"value":"2023-07-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}