Optimal algorithms for parallel polynomial evaluation
From MaRDI portal
Cites work
Cited in
(17)- Minimal parallelism for associative computations under time constraints
- New algorithms for polynomial and trigonometric interpolation on parallel computers
- A survey of techniques in applied computational complexity
- A chained-matrices approach for parallel computation of continued fractions and its applications
- Parallel evaluation of Chebyshev and trigonometric series
- Berechnungen in partiellen Algebren endlichen Typs
- Computing (and Life) Is All about Tradeoffs
- A DIVIDE-AND-INNER PRODUCT PARALLEL ALGORITHM FOR POLYNOMIAL EVALUATION
- PARALLEL POLYNOMIAL EVALUATION BY DECOUPLING ALGORITHM
- Fast Parallel Algorithm for Polynomial Evaluation
- On the Parallel Evaluation of Dwba Integrals
- On the meaning of works by V. M. Khrapchenko
- Limited width parallel prefix circuits
- Stability of parallel algorithms to evaluate Chebyshev series
- Descriptive complexity for neural networks via Boolean networks
- Parallel evaluation of sparse polynomials; based on Estrin's algorithm: conception and analysis of schedulings
- A parallel method for fast and practical high-order Newton interpolation
This page was built for publication: Optimal algorithms for parallel polynomial evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2559140)