论文信息 - Sparse Polynomial Interpolation in Practice - 字舞流文

Sparse Polynomial Interpolation in Practice

We present a few techniques which allow to make better use of hardware integer arithmetic when implementing algorithms for sparse polynomial interpolation.

Joris van der Hoeven | Grégoire Lecerf | Grégoire Lecerf | J. Hoeven

[1] Erich Kaltofen,et al. Early termination in sparse interpolation algorithms , 2003, J. Symb. Comput..

[2] Joris van der Hoeven,et al. On the bit-complexity of sparse polynomial and series multiplication , 2013, J. Symb. Comput..

[3] Erich Kaltofen,et al. Fifteen years after DSC and WLSS2 what parallel computations I do today: invited lecture at PASCO 2010 , 2010, PASCO.

[4] Michael Ben-Or,et al. A deterministic algorithm for sparse multivariate polynomial interpolation , 1988, STOC '88.

[5] Joris van der Hoeven,et al. On the bit-complexity of sparse polynomial multiplication , 2009, ArXiv.

[6] Andrew Arnold,et al. Multivariate sparse interpolation using randomized Kronecker substitutions , 2014, ISSAC.

[7] Erich Kaltofen,et al. Modular rational sparse multivariate polynomial interpolation , 1990, ISSAC '90.

[8] Michael B. Monagan,et al. Parallel sparse polynomial interpolation over finite fields , 2010, PASCO.

[9] Martin E. Hellman,et al. An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[10] R. Gregory Taylor,et al. Modern computer algebra , 2002, SIGA.