Space-time tradeoffs for oblivious integer multiplication

20Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

An extension of a result by Grigoryev is used to derive a lower bound on the space-time product required for integer multiplication when realized by straight-line algorithms. If S is the number of temporary storage locations used by a straight-line algorithm on a random-access machine and T is the number of computation steps, then we show that (S+1)T ≥ Ω(n2) for binary integer multiplication when the basis for the straight-line algorithm is a set of Boolean functions.

Cite

CITATION STYLE

APA

Savage, J. E., & Swamy, S. (1979). Space-time tradeoffs for oblivious integer multiplication. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 71 LNCS, pp. 498–504). Springer Verlag. https://doi.org/10.1007/3-540-09510-1_40

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free