Sparse Polynomial Interpolation with Finitely Many Values for the Coefficients

04/14/2017
by   Qiao-Long Huang, et al.
0

In this paper, we give new sparse interpolation algorithms for black box polynomial f whose coefficients are from a finite set. In the univariate case, we recover f from one evaluation of f(a) for a sufficiently large number a. In the multivariate case, we introduce the modified Kronecker substitution to reduce the interpolation of a multivariate polynomial to the univariate case. Both algorithms have polynomial bit-size complexity.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/15/2017

Revisit Sparse Polynomial Interpolation based on Randomized Kronecker Substitution

In this paper, a new reduction based interpolation algorithm for black-b...
research
06/03/2017

Sparse Rational Function Interpolation with Finitely Many Values for the Coefficients

In this paper, we give new sparse interpolation algorithms for black box...
research
03/29/2021

Interpolation by decomposable univariate polynomials

The usual univariate interpolation problem of finding a monic polynomial...
research
07/19/2016

Reconstruction Algorithms for Sums of Affine Powers

In this paper we study sums of powers of affine functions in (mostly) on...
research
07/22/2019

A note on the complexity of a phaseless polynomial interpolation

In this paper we revisit the classical problem of polynomial interpolati...
research
05/16/2022

Generalised Recombination Interpolation Method (GRIM)

In this paper we develop the Generalised Recombination Interpolation Met...
research
08/05/2020

Parametric spectral analysis: scale and shift

We introduce the paradigm of dilation and translation for use in the spe...

Please sign up or login with your details

Forgot password? Click here to reset