An Approximation Algorithm for the Nearest Decomposable Polynomial in the Hamming Distance
ACM Communications in Computer Algebra · 2023
DOI: 10.1145/3637529.3637532 ↗Kurz gefasst
Fachartikel in der Zeitschrift ACM Communications in Computer Algebra, 2023. Verfasst von Hiroshi Sekigawa. Die Arbeit wurde bisher 1-mal zitiert (Crossref).
Abstract (Originalsprache)
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.
Zitieren
APA
Sekigawa, H. (2023). An Approximation Algorithm for the Nearest Decomposable Polynomial in the Hamming Distance. ACM Communications in Computer Algebra. https://doi.org/10.1145/3637529.3637532
Vancouver
Sekigawa H. An Approximation Algorithm for the Nearest Decomposable Polynomial in the Hamming Distance. ACM Communications in Computer Algebra. 2023. doi:10.1145/3637529.3637532
BibTeX
@article{Sekigawa2023,
author = {Sekigawa, Hiroshi},
title = {An Approximation Algorithm for the Nearest Decomposable Polynomial in the Hamming Distance},
journal = {ACM Communications in Computer Algebra},
year = {2023},
doi = {10.1145/3637529.3637532}
}
EUVIMED