Fast on-line integer multiplication

DOI10.1016/S0022-0000(74)80047-4zbMath0289.68016OpenAlexW2067950298MaRDI QIDQ1847139

Michael J. Fischer, Larry J. Stockmeyer

Publication date: 1974

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0022-0000(74)80047-4

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Online algorithms; streaming algorithms (68W27)

Related Items (14)

Fast online multiplication of real numbers ⋮ Conjunctive and Boolean grammars: the true general case of the context-free grammars ⋮ On the expressive power of univariate equations over sets of natural numbers ⋮ On the Complexity of Multivariate Polynomial Division ⋮ Space complexity in on-line computation ⋮ Relaxed Hensel lifting of triangular sets ⋮ A simple and fast online power series multiplication and its analysis ⋮ Computing with D-algebraic power series ⋮ From implicit to recursive equations ⋮ Turing machines, transition systems, and interaction ⋮ Parsing Boolean grammars over a one-letter alphabet using online convolution ⋮ Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals ⋮ Unnamed Item ⋮ On existence and uniqueness of formal power series solutions of algebraic ordinary differential equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast multiplication of large numbers
• An Algorithm for the Machine Calculation of Complex Fourier Series
• On the Computational Complexity of Algorithms
• Boolean Memories
• On the Minimum Computation Time of Functions

This page was built for publication: Fast on-line integer multiplication