Square rooting is as difficult as multiplication

DOI10.1007/BF02253055zbMath0392.68037OpenAlexW40177797MaRDI QIDQ1251897

Helmut Alt

Publication date: 1979

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02253055

zbMATH Keywords

Asymptotic Time ComplexityMultiplicationSchoenhage- Strassen AlgorithmSquare Rooting

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (2)

Seventeen lines and one-hundred-and-one points ⋮ A computationally efficient scheme for feature extraction with kernel discriminant analysis

Cites Work

• Computational Complexity of Iterative Processes
• Some Properties of Iterative Square-Rooting Methods Using High-Speed Multiplication
• Unnamed Item

This page was built for publication: Square rooting is as difficult as multiplication