Efficient Evaluation of Large Polynomials

Abstract. 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.

• Type: Journal
• Year: 2010
• Where: ICMS
• Authors: Charles E. Leiserson, Liyun Li, Marc Moreno Maza, Yuzhen Xie
• Keywords: Available Software Solutions, Evaluation Cost, ICMS 2010, Polynomials, Software Engineering