Demonstrates an approximate decomposition technique for multivariate polynomials, suggesting innovative applications.
Given a multivariate polynomial f , we consider an approximate decomposition in the Hamming distance, that is, f= g ∘ h \,+ \, δ , f = g ∘ h + δ , where g is a univariate polynomial, h and δ δ are multivariate polynomials, and δ δ has few terms. We propose an algorithm for computing an approximate decomposition and introduce its application to multivariate Horner’s scheme.
No takes yet. Share an insight, caveat, or question.
Tokuda et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: