{"title":"An Approximation Algorithm for the Nearest Decomposable Polynomial in the Hamming Distance","authors":"Hiroshi Sekigawa","doi":"10.1145/3637529.3637532","DOIUrl":null,"url":null,"abstract":"A univariate polynomial f is decomposable if it is the composition f = g(h) of polynomials g and h whose degrees are at least two. We consider the nearest decomposable polynomial to a given polynomial f in the Hamming distance. We propose a polynomial-time approximation algorithm for the nearest decomposable polynomial and analyze the quality of the output.","PeriodicalId":41965,"journal":{"name":"ACM Communications in Computer Algebra","volume":"1 1","pages":"119 - 125"},"PeriodicalIF":0.4000,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Communications in Computer Algebra","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3637529.3637532","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
A univariate polynomial f is decomposable if it is the composition f = g(h) of polynomials g and h whose degrees are at least two. We consider the nearest decomposable polynomial to a given polynomial f in the Hamming distance. We propose a polynomial-time approximation algorithm for the nearest decomposable polynomial and analyze the quality of the output.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
