scientific article; zbMATH DE number 3866580
From MaRDI portal
Publication:3334076
zbMATH Open0544.68033MaRDI QIDQ3334076FDOQ3334076
Authors: David K. Probst, Vangalur S. Alagar 
Publication date: 1982
Title of this publication is not available (Why is that?)
Recommendations
- Chunky and equal-spaced polynomial multiplication
- On the choice of a multiplication algorithm for polynomials and polynomial matrices
- On fast multiplication of polynomials over arbitrary algebras
- Comparing the speed of programs for sparse polynomial multiplication
- Parallel multiplication and powering of polynomials
analysis of algorithmsalgebraic computationpolynomial multiplicationadaptive hybrid algorithmdense multivariate polynomialsunivariate algorithms
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to field theory (12-04)
Cited In (8)
- Chunky and equal-spaced polynomial multiplication
- An efficient algorithm for the multivariable Adomian polynomials
- BALANCED DENSE POLYNOMIAL MULTIPLICATION ON MULTI-CORES
- Development of TRIP: Fast Sparse Multivariate Polynomial Multiplication Using Burst Tries
- On the Complexity of Hybrid $n$ -Term Karatsuba Multiplier for Trinomials
- Title not available (Why is that?)
- Dense polynomial multiplication with reduced array manipulation overhead
- Comparing the speed of programs for sparse polynomial multiplication
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3334076)
