Dense polynomial multiplication with reduced array manipulation overhead

DOI10.1016/0020-0255(93)90024-GzbMath0770.65006OpenAlexW2039753221MaRDI QIDQ1204791

Shovonlal Kundu

Publication date: 29 March 1993

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(93)90024-g

zbMATH Keywords

algorithmComplexitypolynomial multiplicationreduced array manipulation

Mathematics Subject Classification ID

Computation of special functions and constants, construction of tables (65D20) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the implementation of Strassen's fast multiplication algorithm
• Matrix multiplication and division of polynomials
• An Improved Lower Bound on Polynomial Multiplication
• New Algorithms for Polynomial Multiplication
• Computer-assisted microanalysis of programs
• A Sorting Algorithm for Polynomial Multiplication

This page was built for publication: Dense polynomial multiplication with reduced array manipulation overhead