Fast parallel computation of polynomials using few processors
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.
Unable to display preview. Download preview PDF.
- A. Borodin and I. Munro. The Computational Complexity of Algebraic and Numeric Problems. American Elsevier, New York, 1975.Google Scholar
- S.A. Cook. Deterministic CFL's are accepted simultaneously in polynomial time and log squared space. Proc. 11th ACM Symp. on Theory of Computing /1979/ 338–345.Google Scholar
- L. Csanky. Fast parallel inversion algorithms. SIAM J. on Computing, 5:4 /1976/ 618–623.Google Scholar
- L. Hyafil. On the parallel evaluation of multivariate polynomials. Proc. 10th ACM Symp. on Theory of Computing /1978/ 193–195.Google Scholar
- W.L. Ruzzo. On uniform circuit complexity. Proc. 20th IEEE Symp. on Foundations of Computer Science /1979/ 312–318.Google Scholar
- S. Skyum and L.G. Valiant. A complexity theory based on Boolean algebra. /1981/. To appear.Google Scholar
- V. Strassen. Vermeidung von Divisionen. J. Reine und Angewandte Mathematik 264 /1973/ 182–202.Google Scholar
- L.G. Valiant. Completeness classes in algebra. Proc. 11th ACM Symp. on Theory of Computing, /1979/ 249–261.Google Scholar