Deterministic sparse interpolation of black-box multivariate polynomials using Kronecker type substitutions
From MaRDI portal
Publication:5064243
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.
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
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)