×
Alt, H.

Square rooting is as difficult as multiplication. (English) Zbl 0392.68037

Computing 21, 221-232 (1979).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0392.68037

Cited in 3 Documents

MSC:

68Q25 Analysis of algorithms and problem complexity

Keywords:

Square Rooting; Multiplication; Asymptotic Time Complexity; Schoenhage- Strassen Algorithm
Cite Review PDF
Full Text: DOI

References:

[1] Aho, Hopcroft, Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974. · Zbl 0326.68005
[2] Alt: Algorithms for Square Root Extraction. Report A 77-12, Fachbereich Angewandte Mathematik und Informatik, Saarbrücken, 1977.
[3] Spaniol: Arithmetik in Rechenanlagen. (Teubner Studienbücher, Bd. 34) 1976.
[4] Ramamoorthy, Goodman, Kim: Some Properties of Iterative Square-Rooting Methods using High-Speed Multiplication. IEEE-Transactions C21, 2 (1972). · Zbl 0235.68021
[5] Traub: Computational Complexity of Iterative Processors. SIAM Journal of Comp.1, 167–179 (1972). · Zbl 0226.68025 · doi:10.1137/0201012
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.