Rapid multiplication modulo the sum and difference of highly composite numbers
From MaRDI portal
Recommendations
Cites work
- Discrete Weighted Transforms and Large-Integer Arithmetic
- scientific article; zbMATH DE number 3750146 (Why is no real title available?)
- scientific article; zbMATH DE number 108109 (Why is no real title available?)
- scientific article; zbMATH DE number 846277 (Why is no real title available?)
- Roundoff Error Analysis of the Fast Fourier Transform
- The twenty-fourth Fermat number is composite
Cited in
(7)- Optimization of multidigit multiplication based on discrete (Fourier, cosine, sine) transforms in the parallel computing model
- Error bounds on complex floating-point multiplication
- Discrete Weighted Transforms and Large-Integer Arithmetic
- Fast convolutions of packed strings and pattern matching with wildcards
- Multiple product modulo arbitrary numbers
- Multiple product modulo arbitrary numbers
- The nature of numbers: real computing
This page was built for publication: Rapid multiplication modulo the sum and difference of highly composite numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4780378)
