Kronecker substitution is a technique named after Leopold Kronecker for determining the coefficients of an unknown polynomial by evaluating it at aâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Qiao-Long Huang, Xiao-Shan Gao
- ArXiv
- 2017

In this paper, a new Monte Carlo interpolation algorithm for sparse multivariate polynomials is given based on the idea ofâ€¦Â (More)

Is this relevant?

2017

2017

- Qiao-Long Huang, Xiao-Shan Gao
- CASC
- 2017

In this paper, we give new sparse interpolation algorithms for black box polynomial f whose coefficients are from a finite setâ€¦Â (More)

Is this relevant?

2016

2016

- Jiaxiong Hu, Michael B. Monagan
- ISSAC
- 2016

We present a parallel GCD algorithm for sparse multivariate polynomials with integer coefficients. The algorithm combines aâ€¦Â (More)

Is this relevant?

2015

2015

- 2015

We saw in Lecture 3 how to efficiently multiply integers, and, using Kronecker substitution, how to efficiently multiplyâ€¦Â (More)

Is this relevant?

2014

2014

- Andrew Arnold, Daniel S. Roche
- ISSAC
- 2014

We present new techniques for reducing a multivariate sparse polynomial to a univariate polynomial. The reduction works similarlyâ€¦Â (More)

Is this relevant?

2014

2014

- Joris van der Hoeven, GrÃ©goire Lecerf
- ACM Comm. Computer Algebra
- 2014

Sparse polynomial interpolation consists in recovering of a sparse representation of a polynomial P given by a blackbox programâ€¦Â (More)

Is this relevant?

2012

2012

- Francesco Biscani
- ISSAC
- 2012

We present a high performance algorithm for the parallel multiplication of sparse multivariate polynomials on modern computerâ€¦Â (More)

Is this relevant?

2011

2011

- Jean-Guillaume Dumas, Laurent Fousse, Bruno Salvy
- J. Symb. Comput.
- 2011

We present algorithms to perform modular polynomial multiplication or modular dot product efficiently in a single machine wordâ€¦Â (More)

Is this relevant?

2011

2011

- Markus BlÃ¤ser, Christian Engels
- STACS
- 2011

We construct a hitting set generator for sparse multivariate polynomials over the reals. The seed length of our generator is Oâ€¦Â (More)

Is this relevant?

2009

2009

- David Harvey
- J. Symb. Comput.
- 2009

We give several new algorithms for dense polynomial multiplication based on the Kronecker substitution method. For moderatelyâ€¦Â (More)

Is this relevant?