Faster sparse interpolation of straight-line programs
arXiv:1304.3483 · doi:10.1007/978-3-319-02297-0_5
Abstract
We give a new probabilistic algorithm for interpolating a "sparse" polynomial f given by a straight-line program. Our algorithm constructs an approximation f* of f, such that their difference probably has at most half the number of terms of f, then recurses on their difference. Our approach builds on previous work by Garg and Schost (2009), and Giesbrecht and Roche (2011), and is asymptotically more efficient in terms of the total cost of the probes required than previous methods, in many cases.
15 pages, 1 table, 4 procedures, version appeared at Computer Algebra in Scientific Computing (CASC) 2013