Parallel multiplication and powering of polynomials
From MaRDI portal
Publication:808710
DOI10.1016/S0747-7171(08)80108-3zbMATH Open0732.68060MaRDI QIDQ808710FDOQ808710
Authors: Carl G. Ponder 
Publication date: 1991
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Recommendations
- On fast multiplication of polynomials over arbitrary algebras
- Parallel Algorithms for Algebraic Problems
- Sparse polynomial powering using heaps
- On the choice of a multiplication algorithm for polynomials and polynomial matrices
- Parallel algorithms for some algebraic operations on polynomial equations
parallel algorithmssparse polynomialsalgebraic manipulationdense polynomialsshared-memory multiprocessing
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sorting X + Y
- On Computing the Discrete Fourier Transform
- A Family of Algorithms for Powering Sparse Polynomials
- Title not available (Why is that?)
- On the Computation of Powers of Sparse Polynomials
- Polynomial Multiplication, Powers and Asymptotic Analysis: Some Comments
Cited In (15)
- Title not available (Why is that?)
- Chunky and equal-spaced polynomial multiplication
- Code Generation for Polynomial Multiplication
- Title not available (Why is that?)
- On the bit-complexity of sparse polynomial and series multiplication
- BALANCED DENSE POLYNOMIAL MULTIPLICATION ON MULTI-CORES
- Title not available (Why is that?)
- Title not available (Why is that?)
- Obtuse matrix of arithmetic table
- Representations and Parallel Computations for Rational Functions
- Implementation of some algorithms for accelerating computer calculations
- Complexity and performance results for non FFT-based univariate polynomial multiplication
- Parallel sparse polynomial multiplication using heaps
- Sparse polynomial powering using heaps
- On the choice of a multiplication algorithm for polynomials and polynomial matrices
This page was built for publication: Parallel multiplication and powering of polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q808710)
