New answers tagged multiplication
0
votes
Linear time approximate multiplication
Upon further thought I realized the best there might be is a linear time algorithm to compute $ab+\ $ like $Θ(\sqrt{ab})$ (perhaps add a log factor) and then notice you can compute $ab$ to good ...
3
votes
Accepted
Linear time approximate multiplication
If you just want a $\Theta(ab)$ precision then we can just consider the binary representation of $a, b$, and we can easily get two "ceiling" power of 2:
$$
a' = \min \{ 2^w | 2^w \ge a\} \\
...
Top 50 recent answers are included
Related Tags
multiplication × 88algorithms × 34
arithmetic × 14
matrices × 14
time-complexity × 11
integers × 11
algorithm-analysis × 9
polynomials × 9
complexity-theory × 7
modular-arithmetic × 7
runtime-analysis × 6
parallel-computing × 5
number-theory × 5
computer-architecture × 4
numerical-algorithms × 4
binary × 3
fast-fourier-transform × 3
turing-machines × 2
asymptotics × 2
reference-request × 2
circuits × 2
floating-point × 2
memory-access × 2
python × 2
divide-and-conquer × 2