Minimizing the evaluation cost of a polynomial expression is a fundamental problem in computer science. We propose tools that, for a polynomial P given as the sum of its terms, compute a representation that permits a more efficient evaluation. Our algorithm runs in d(nt)O(1) bit operations plus dtO(1) operations in the base field where d, n and t are the total degree, number of variables and number of terms of P. Our experimental results show that our approach can handle much larger polynomials than other available software solutions. Moreover, our computed representation reduce the evaluation cost of P substantially. © 2010 Springer-Verlag.
CITATION STYLE
Leiserson, C. E., Li, L., Maza, M. M., & Xie, Y. (2010). Efficient evaluation of large polynomials. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6327 LNCS, pp. 342–353). https://doi.org/10.1007/978-3-642-15582-6_55
Mendeley helps you to discover research relevant for your work.