It is shown that any multivariate polynomial that can be computed sequentially in C steps and has degree d can be computed in parallel in 0((log d) (log C + log d)) steps using only (Cd)0(1) processors.
Mathematical Foundations of Computer Science 1981: Proceedings, 10th Symposium Štrbské Pleso, Czechoslovakia August 31 – September 4, 1981, 1981, p. 132-139
Main Research Area:
Lecture Notes in Computer Science
Symposium on Mathematical Foundations of Computer Science, 1981