{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T09:16:14Z","timestamp":1775121374593,"version":"3.50.1"},"reference-count":4,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2009,2,6]],"date-time":"2009-02-06T00:00:00Z","timestamp":1233878400000},"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":[[2009,2,6]]},"abstract":"<jats:p>We describe an efficient algorithm and an implementation for computing an absolute factorization of a bivariate polynomial with a given bidegree. Results of experimentation and an illustrative example are provided. This algorithm is a generalization of the previous one by Rupprecht-Galligo-Ch\u00e8ze which works after a generic change of coordinates. It relies on a general algorithmic approach based on a study of the curve defined by the polynomial to factorize in a toric surface.<\/jats:p>","DOI":"10.1145\/1504347.1504362","type":"journal-article","created":{"date-parts":[[2009,2,17]],"date-time":"2009-02-17T13:18:18Z","timestamp":1234876698000},"page":"151-153","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Absolute factoring of bidegree bivariate polynomials"],"prefix":"10.1145","volume":"42","author":[{"given":"G.","family":"Ch\u00e8ze","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Nice Sophia-Antipolis, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Elkadi","sequence":"additional","affiliation":[{"name":"INRIA-UNS"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Galligo","sequence":"additional","affiliation":[{"name":"INRIA-UNS"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Weimann","sequence":"additional","affiliation":[{"name":"Physical and Chemical Graduate School G\u00f6ttingen"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,2,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1005285.1005300"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2005.11.004"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2008.03.007"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2007.01.003"}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1504347.1504362","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1504347.1504362","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:29:30Z","timestamp":1750253370000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1504347.1504362"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,2,6]]},"references-count":4,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,2,6]]}},"alternative-id":["10.1145\/1504347.1504362"],"URL":"https:\/\/doi.org\/10.1145\/1504347.1504362","relation":{},"ISSN":["1932-2240"],"issn-type":[{"value":"1932-2240","type":"print"}],"subject":[],"published":{"date-parts":[[2009,2,6]]},"assertion":[{"value":"2009-02-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}