A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is
Journal of the ACM
Algorithms on multivariate polynomials represented by straight-line programs are developed. First it is shown that most algebraic algorithms can be probabilistically applied to data that is givenb ya straight-line computation. Testing such rational numeric data for zero, for instance, is facilitated by random evaluations modulo random prime numbers. Then auxiliary algorithms are constructed that determine the coefficients of a multivariate polynomial in a single variable. The first main resultdoi:10.1145/42267.45069 fatcat:hjux5gwgybe5nikgp3nozu7zzq