1978 · 15 citations · 2 references
Mathematical ProgrammingParallel EvaluationEngineeringComputational Number TheoryOrthogonal PolynomialParallel Complexity TheoryComputer AlgebraAlgebraic MethodComputational ComplexityParallel ProgrammingComputer ScienceMultivariate Polynomial PDiscrete MathematicsParallel ComputingParallel StepsDegree DApproximation TheoryMultivariate Approximation
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.
2
Fast parallel matrix inversion algorithms
L. Csanky · 1975 · 47 citations
Numerical Analysis, Computational Complexity Theory, Engineering +14
Laurent Hyafil · 1977 · 10 citations