Improved Parallel Polynomial Division
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1256648
- The CREW PRAM Complexity of Modular Inversion
- Polynomial division and its computational complexity
- Modular exponentiation via the explicit Chinese remainder theorem
- Parallel evaluation of the determinant and of the inverse of a matrix
- Computing Powers in Parallel
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- The bit-cost of some algorithms for the solution of linear systems
- On an efficient algorithm for big rational number computations by parallel \(p\)-adics
- A logarithmic Boolean time algorithm for parallel polynomial division
Cited in
(12)- Fast parallel polynomial division via reduction to triangular Toeplitz matrix inversion and to polynomial inversion modulo a power
- Polynomial division and its computational complexity
- A logarithmic Boolean time algorithm for parallel polynomial division
- Polynomial division with a remainder by means of evaluation and interpolation
- Parametrization of Newton's iteration for computations with structured matrices and applications
- Parallel computation of polynomial GCD and some related parallel computations over abstract fields
- scientific article; zbMATH DE number 3958730 (Why is no real title available?)
- scientific article; zbMATH DE number 1256648 (Why is no real title available?)
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials
- Fast parallel algorithms for polynomial division over an arbitrary field of constants
- On the parallel evaluation of multivariate polynomials
- Parallel algorithms for matrix polynomial division
This page was built for publication: Improved Parallel Polynomial Division
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4202215)
