evaluation of polynomials with super-preconditioning
In an effort to understand the complexity of arithmetic computation, a number of researchers [1,5,7,8,9,11] have studied the following question: Given a polynomial f(x), Find a minimal cost straightline program that computes f(x).@@@@ In this paper this question is generalized to the following question: Given a polynomial f(x) and an operator &Dgr; that maps polynomials to sets of polynomials, Find a minimal cost straightline program that computes some h(x) &egr; &Dgr;(f(x)).
evaluation polynomial complexity computation research minimal cost paper general operability maps