Sciweavers

ISSAC
1999
Springer
86views Mathematics» more  ISSAC 1999»
13 years 11 months ago
How Fast Can We Compute Products?
In this paper we consider the problem of fast computation of n-ary products, for large n, over arbitrary precision integer or rational number domains. The combination of loop unro...
V. Kislenkov, V. Mitrofanov, Eugene V. Zima