On the Time Required to Perform Multiplication

DOI10.1145/321420.321438zbMath0197.43901OpenAlexW1964869680WikidataQ105339959 ScholiaQ105339959MaRDI QIDQ5595908

Shmuel Winograd

Publication date: 1967

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321420.321438

zbMATH Keywords

computer science and automata

Related Items

Approximation in a continuous model of computing, A flow-mode, self-steering, cellular multiplier-summation processor, Complexity of algorithms and computations, On the Minimum Computation Time of Functions, Polynomial expressions for non-binomial structures, Characteristic measures of switching functions, On the computational complexity of finite functions and semigroup multiplication