On the parallel evaluation of multivariate polynomials

Authors:
Laurent Hyafil
Affiliations:
-
Venue:
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Year:
1978

Citing 0
Cited 4

Lower bounds for non-commutative computation

STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Probabilistic Algorithms for Deciding Equivalence of Straight-Line Programs

Journal of the ACM (JACM)
Negation can be exponentially powerful

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Completeness classes in algebra

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.