Abstract
An algorithm is given for computing the product of two N-digit binary numbers by O (N lg N lg lg N) steps. Two ways of implementing the algorithm are considered: multitape Turing machines and logical nets (with step=binary logical element.) © 1971 Springer-Verlag.
Cite
CITATION STYLE
APA
Schönhage, A., & Strassen, V. (1971). Schnelle Multiplikation großer Zahlen. Computing, 7(3–4), 281–292. https://doi.org/10.1007/BF02242355
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free