On short multiplications and divisions

DOI10.1007/S002000000037zbMATH Open0968.68200OpenAlexW2092959822WikidataQ114231192 ScholiaQ114231192MaRDI QIDQ1583887FDOQ1583887

Authors: Thom Mulders 

Publication date: 10 September 2001

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002000000037

Recommendations

• Multiplicative Functions in Short Intervals
• Multiplicative functions in short intervals
• On divisor problems in short intervals
• Short sums of multiplicative functions
• Short sums of multiplicative functions

zbMATH Keywords

polynomial arithmeticpower series arithmetic

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Analysis of algorithms (68W40)

Cited In (15)

• Code Generation for Polynomial Multiplication
• The Karatsuba integer middle product
• Fast convolutions meet Montgomery
• A note on the paper ``Multiplication of polynomials modulo \(x^n\) by Murat Cenk and Ferruh Özbudak
• Relax, but don't be too lazy
• An algorithm for multiple-precision floating-point multiplication
• Faster truncated integer multiplication
• A probabilistic algorithm for verifying polynomial middle product in linear time
• A long note on Mulders' short product
• A simple and fast online power series multiplication and its analysis
• Generic reductions for in-place polynomial multiplication
• Computing clipped products
• Practical divide-and-conquer algorithms for polynomial arithmetic
• Solving structured linear systems with large displacement rank
• On the choice of a multiplication algorithm for polynomials and polynomial matrices

This page was built for publication: On short multiplications and divisions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1583887)