Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

ISSAC
1999
Springer

favoriteEmaildiscussreport

86views Mathematics» more ISSAC 1999»

How Fast Can We Compute Products?

13 years 9 months ago

How Fast Can We Compute Products?

Download www.cybertester.com

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 unrolling, chains of recurrences techniques and analogs of binary powering allows us to obtain order-of-magnitude speed improvements for such computations. Three di erent implementations of the technique (in Maple, C++ and Java) are described. Many examples together with timings are given.

V. Kislenkov, V. Mitrofanov, Eugene V. Zima

Real-time Traffic

Arbitrary Precision Integer | Di Erent Implementations | ISSAC 1999 | Mathematics | Rational Number Domains |

claim paper

Related Content

» Get real whats wrong with hci prototyping and how can we fix it

» Learning in Gibbsian Fields How Accurate and How Fast Can It Be

» Can We Get Better Assessment From A Tutoring System Compared to Traditional Paper Testing ...

» How Much Can We Gain from Supervised Word Alignment

» Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature

» Spam spam spam spam how can we stop it

» Statistical static timing analysis how simple can we get

» How Far Can We Go with Local Optimization in RealTime Stereo Matching

» How to trust robots further than we can throw them

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	ISSAC
Authors	V. Kislenkov, V. Mitrofanov, Eugene V. Zima

Comments (0)