Faster Sparse Multivariate Polynomial Interpolation of Straight-Line Programs
Symbolic Computation
2014-12-16 v2 Data Structures and Algorithms
Abstract
Given a straight-line program whose output is a polynomial function of the inputs, we present a new algorithm to compute a concise representation of that unknown function. Our algorithm can handle any case where the unknown function is a multivariate polynomial, with coefficients in an arbitrary finite field, and with a reasonable number of nonzero terms but possibly very large degree. It is competitive with previously known sparse interpolation algorithms that work over an arbitrary finite field, and provides an improvement when there are a large number of variables.
Cite
@article{arxiv.1412.4088,
title = {Faster Sparse Multivariate Polynomial Interpolation of Straight-Line Programs},
author = {Andrew Arnold and Mark Giesbrecht and Daniel S. Roche},
journal= {arXiv preprint arXiv:1412.4088},
year = {2014}
}
Comments
33 pages. Submitted for publication