Uniform closure properties of P-computable functions
Erich Kaltofen · 1986
Valiant [24] introduced the notion of a family of p-computable polynomials as those multivariate polynomials of polynomially-bounded degree and straight-line computation length. He raised the question of whether p-computable families would be closed under natural mathematical operations and showed that this is true for taking repeated partial derivatives inasingle variable,