抄録
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.
| 本文言語 | English |
|---|---|
| ページ（範囲） | 119-125 |
| ページ数 | 7 |
| ジャーナル | ACM Communications in Computer Algebra |
| 巻 | 57 |
| 号 | 3 |
| DOI | |
| 出版ステータス | Published - 13 12月 2023 |