{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:48:53Z","timestamp":1750308533607,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,7,23]],"date-time":"2014-07-23T00:00:00Z","timestamp":1406073600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"LIX-Qualcomm-Carnot fellowship"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,7,23]]},"DOI":"10.1145\/2608628.2608649","type":"proceedings-article","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T14:23:03Z","timestamp":1404224583000},"page":"224-231","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Computing low-degree factors of lacunary polynomials"],"prefix":"10.1145","author":[{"given":"Bruno","family":"Grenet","sequence":"first","affiliation":[{"name":"LIX -- UMR, \u00c9cole Polytechnique, Palaiseau Cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,7,23]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"Mathematical surveys and monographs","doi-asserted-by":"crossref","DOI":"10.1090\/surv\/035","volume-title":"Algebraic Geometry for Scientists and Engineers","author":"Abhyankar S. S.","year":"1990","unstructured":"S. S. Abhyankar . Algebraic Geometry for Scientists and Engineers , volume 35 of Mathematical surveys and monographs . Am. Math. Soc ., 1990 . S. S. Abhyankar. Algebraic Geometry for Scientists and Engineers, volume 35 of Mathematical surveys and monographs. Am. Math. Soc., 1990."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005285.1005289"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.4169\/000298910x515785"},{"key":"e_1_3_2_1_4_1","volume-title":"Computing the multilinear factors of lacunary polynomials without heights. Manuscript (submitted)","author":"Chattopadhyay A.","year":"2013","unstructured":"A. Chattopadhyay , B. Grenet , P. Koiran , N. Portier , and Y. Strozecki . Computing the multilinear factors of lacunary polynomials without heights. Manuscript (submitted) , 2013 . arXiv:1311.5694. A. Chattopadhyay, B. Grenet, P. Koiran, N. Portier, and Y. Strozecki. Computing the multilinear factors of lacunary polynomials without heights. Manuscript (submitted), 2013. arXiv:1311.5694."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2465506.2465932"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02112431"},{"key":"e_1_3_2_1_7_1","series-title":"Algorithms Comput","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/3-540-27357-3_9","volume-title":"Solving Polynomial Equations","author":"Ch\u00e8ze G.","year":"2005","unstructured":"G. Ch\u00e8ze and A. Galligo . Four lectures on polynomial absolute factorization . In A. Dickenstein and I. Z. Emiris, editors, Solving Polynomial Equations , volume 14 of Algorithms Comput . Math ., pages 339 -- 392 . 2005 . G. Ch\u00e8ze and A. Galligo. Four lectures on polynomial absolute factorization. In A. Dickenstein and I. Z. Emiris, editors, Solving Polynomial Equations, volume 14 of Algorithms Comput. Math., pages 339--392. 2005."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1998.0242"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry","author":"de Berg M.","year":"2000","unstructured":"M. de Berg , M. van Kreveld , M. Overmars , and O. C. Schwarzkopf . Computational Geometry . Springer , 2000 . M. de Berg, M. van Kreveld, M. Overmars, and O. C. Schwarzkopf. Computational Geometry. Springer, 2000."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-001-0024-0"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0214035"},{"key":"e_1_3_2_1_12_1","series-title":"Advances in Computing Research","first-page":"375","volume-title":"Randomness and Computation","author":"Kaltofen E.","year":"1989","unstructured":"E. Kaltofen . Factorization of polynomials given by straight-line programs. In S. Micali, editor, Randomness and Computation , volume 5 of Advances in Computing Research , pages 375 -- 412 . 1989 . E. Kaltofen. Factorization of polynomials given by straight-line programs. In S. Micali, editor, Randomness and Computation, volume 5 of Advances in Computing Research, pages 375--412. 1989."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073884.1073914"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1145768.1145798"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2007.11.005"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80015-6"},{"key":"e_1_3_2_1_17_1","volume-title":"On the intersection of a sparse curve and a low-degree curve: A polynomial version of the lost theorem. arXiv:1310.2447","author":"Koiran P.","year":"2013","unstructured":"P. Koiran , N. Portier , and S. Tavenas . On the intersection of a sparse curve and a low-degree curve: A polynomial version of the lost theorem. arXiv:1310.2447 , 2013 . P. Koiran, N. Portier, and S. Tavenas. On the intersection of a sparse curve and a low-degree curve: A polynomial version of the lost theorem. arXiv:1310.2447, 2013."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1515\/9783110285581.277","volume-title":"Number theory in progress","author":"Jr H. Lenstra","year":"1999","unstructured":"H. Lenstra Jr . On the factorization of lacunary polynomials . In Number theory in progress , pages 277 -- 291 . De Gruyter , 1999 . H. Lenstra Jr. On the factorization of lacunary polynomials. In Number theory in progress, pages 277--291. De Gruyter, 1999."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.1998.12004987"},{"key":"e_1_3_2_1_20_1","volume-title":"Modern Computer Algebra. Camb","author":"von zur Gathen J.","year":"2003","unstructured":"J. von zur Gathen and J. Gerhard . Modern Computer Algebra. Camb . U. Press , 2 nd edition, 2003 . J. von zur Gathen and J. Gerhard. Modern Computer Algebra. Camb. U. Press, 2nd edition, 2003.","edition":"2"}],"event":{"name":"ISSAC '14: International Symposium on Symbolic and Algebraic Computation","sponsor":["ACM Association for Computing Machinery","SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Kobe Japan","acronym":"ISSAC '14"},"container-title":["Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2608628.2608649","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2608628.2608649","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T18:55:59Z","timestamp":1750272959000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2608628.2608649"}},"subtitle":["a Newton-Puiseux approach"],"short-title":[],"issued":{"date-parts":[[2014,7,23]]},"references-count":20,"alternative-id":["10.1145\/2608628.2608649","10.1145\/2608628"],"URL":"https:\/\/doi.org\/10.1145\/2608628.2608649","relation":{},"subject":[],"published":{"date-parts":[[2014,7,23]]},"assertion":[{"value":"2014-07-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}