On the parallel evaluation of multivariate polynomials
暂无分享,去创建一个
We prove that any multivariate polynomial P of degree d that can be computed with C(P) multiplications-divisions can be computed in O(log d.log C(P)) parallel steps and O(log d) parallel multiplicative steps.
[1] L. Csanky,et al. Fast parallel matrix inversion algorithms , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).
[2] Laurent Hyafil. The power of commutativity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[3] Allan Borodin,et al. The computational complexity of algebraic and numeric problems , 1975, Elsevier computer science library.
[4] K. Ramachandra,et al. Vermeidung von Divisionen. , 1973 .