Deterministic sparse interpolation of black-box multivariate polynomials using Kronecker type substitutions
From MaRDI portal
Publication:5064243
DOI10.1360/N012019-00018zbMATH Open1499.65054arXiv1710.01301MaRDI QIDQ5064243FDOQ5064243
Authors: Qiao-Long Huang, Xiao-Shan Gao
Publication date: 21 March 2022
Published in: SCIENTIA SINICA Mathematica (Search for Journal in Brave)
Abstract: In this paper, we propose two new deterministic interpolation algorithms for a sparse multivariate polynomial given as a standard black-box by introducing new Kronecker type substitutions. Let be a sparse black-box polynomial with a degree bound . When or a finite field, our algorithms either have better bit complexity or better bit complexity in than existing deterministic algorithms. In particular, in the case of deterministic algorithms for standard black-box models, our second algorithm has the current best complexity in which is the dominant factor in the complexity.
Full work available at URL: https://arxiv.org/abs/1710.01301
Recommendations
- Revisit sparse polynomial interpolation based on randomized Kronecker substitution
- A new deterministic algorithm for sparse multivariate polynomial interpolation
- Sparse polynomial interpolation with finitely many values for the coefficients
- Multivariate sparse interpolation using randomized Kronecker substitutions
- A new algorithm for sparse interpolation of multivariate polynomials
Numerical interpolation (65D05) Interpolation in approximation theory (41A05) Algorithms for approximation of functions (65D15)
Cited In (3)
This page was built for publication: Deterministic sparse interpolation of black-box multivariate polynomials using Kronecker type substitutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5064243)