On the number of additions to compute specific polynomials (Preliminary Version)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Uniform closure properties of P-computable functions
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
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)).