An approximate decomposition of a multivariate polynomial and its application

DOI10.1007/S11786-025-00621-5MaRDI QIDQ7231072zbMATH OpenFDO

Authors Rikuna Tokuda, Hiroshi Sekigawa

Publication date 21 April 2026

Published in Mathematics in Computer Science (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11786-025-00621-5

zbMATH Keywords

approximation algorithmHorner's schemepolynomial decompositionpolynomial evaluation

Mathematics Subject Classification ID

Special polynomials in general fields (12E10) Approximation algorithms (68W25) Symbolic computation and algebraic computation (68W30)

Cites work

• A polynomial time algorithm for computing all minimal decompositions of a polynomial
• An approximation algorithm for the nearest decomposable polynomial in the Hamming distance
• An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography
• Counting decomposable multivariate polynomials
• Counting decomposable univariate polynomials
• Functional decomposition of polynomials: the tame case
• Functional decomposition of polynomials: the wild case
• Functional decomposition using principal subfields
• High order derivatives and decomposition of multivariate polynomials
• Multivariate polynomial decomposition
• New algorithms for exact and approximate polynomial decomposition
• Polynomial decomposition algorithms
• Polynomial decomposition algorithms
• The multivariate Horner scheme revisited

This page was built for publication: An approximate decomposition of a multivariate polynomial and its application

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7231072)