{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T13:42:28Z","timestamp":1775569348030,"version":"3.50.1"},"reference-count":5,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T00:00:00Z","timestamp":1693526400000},"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":[[2023,9]]},"abstract":"<jats:p>\n            A univariate polynomial\n            <jats:italic>f<\/jats:italic>\n            is decomposable if it is the composition\n            <jats:italic>f<\/jats:italic>\n            =\n            <jats:italic>g<\/jats:italic>\n            (\n            <jats:italic>h<\/jats:italic>\n            ) of polynomials\n            <jats:italic>g<\/jats:italic>\n            and\n            <jats:italic>h<\/jats:italic>\n            whose degrees are at least two. We consider the nearest decomposable polynomial to a given polynomial\n            <jats:italic>f<\/jats:italic>\n            in the Hamming distance. We propose a polynomial-time approximation algorithm for the nearest decomposable polynomial and analyze the quality of the output.\n          <\/jats:p>","DOI":"10.1145\/3637529.3637532","type":"journal-article","created":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T17:06:57Z","timestamp":1702487217000},"page":"119-125","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["An Approximation Algorithm for the Nearest Decomposable Polynomial in the Hamming Distance"],"prefix":"10.1145","volume":"57","author":[{"given":"Hiroshi","family":"Sekigawa","sequence":"first","affiliation":[{"name":"Department of Applied Mathematics, Tokyo University of Science, Kagurazaka, Shinjuku-ku, Tokyo, Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,12,13]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02124750"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/258726.258783"},{"key":"e_1_2_1_3_1","volume-title":"North-Holland","author":"de Bruijn N. G.","year":"1961","unstructured":"N. G. de Bruijn. Asymptotic Methods in Analysis. North-Holland, 1961."},{"issue":"12","key":"e_1_2_1_4_1","first-page":"1449","article-title":"Sur l'inversion de yaey au moyen des nombres de Stirling associ\u00e9s","volume":"320","author":"Jeffrey D. J.","year":"1995","unstructured":"D. J. Jeffrey, R. M. Corless, D. E. G. Hare, and D. E. Knuth. Sur l'inversion de yaey au moyen des nombres de Stirling associ\u00e9s. Comptes Rendus Acad. Sci. Paris Serie I-Mathematique, 320(12):1449--1452, 1995.","journal-title":"Comptes Rendus Acad. Sci. Paris Serie I-Mathematique"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1080\/03610926.2011.602490"}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637529.3637532","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3637529.3637532","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:04:23Z","timestamp":1750291463000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637529.3637532"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["10.1145\/3637529.3637532"],"URL":"https:\/\/doi.org\/10.1145\/3637529.3637532","relation":{},"ISSN":["1932-2240"],"issn-type":[{"value":"1932-2240","type":"print"}],"subject":[],"published":{"date-parts":[[2023,9]]},"assertion":[{"value":"2023-12-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}