scientific article; zbMATH DE number 3866580

MaRDI QIDQ3334076zbMATH OpenFDO

Authors David K. Probst, Vangalur S. Alagar

Publication date 1982

zbMATH Keywords

analysis of algorithmsalgebraic computationpolynomial multiplicationadaptive hybrid algorithmdense multivariate polynomialsunivariate algorithms

Mathematics Subject Classification ID

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)

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

Cited in

(8)

• On the Complexity of Hybrid $n$ -Term Karatsuba Multiplier for Trinomials
• Dense polynomial multiplication with reduced array manipulation overhead
• Development of TRIP: Fast Sparse Multivariate Polynomial Multiplication Using Burst Tries
• Comparing the speed of programs for sparse polynomial multiplication
• An efficient algorithm for the multivariable Adomian polynomials
• scientific article; zbMATH DE number 3858403 (Why is no real title available?)
• BALANCED DENSE POLYNOMIAL MULTIPLICATION ON MULTI-CORES
• Chunky and equal-spaced 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)