Given a finite number of sparse polynomials, we present a new algorithm, along with its C++ implementation, to compute an efficient straight-line program which is able to simultaneously evaluate these polynomials at a given point.

Authors: Joris van der Hoeven, Grégoire Lecerf, Arnaud Minondo

View: Html, TeXmacs, Pdf, BibTeX