汉明距离中最近可分解多项式的近似算法

IF 0.4 Q4 MATHEMATICS, APPLIED

ACM Communications in Computer Algebra Pub Date : 2023-09-01 DOI:10.1145/3637529.3637532

Hiroshi Sekigawa

{"title":"汉明距离中最近可分解多项式的近似算法","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":"{\"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}","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

摘要

如果单变量多项式 f 是阶数至少为 2 的多项式 g 和 h 的组合 f = g(h)，则该多项式 f 是可分解的。我们考虑与给定多项式 f 在汉明距离上最近的可分解多项式。我们为最近可分解多项式提出了一种多项式时间近似算法，并分析了输出结果的质量。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An Approximation Algorithm for the Nearest Decomposable Polynomial in the Hamming Distance

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

ACM Communications in Computer Algebra MATHEMATICS, APPLIED-

CiteScore

0.70

自引率

0.00%

发文量