Abstract
It is shown that multiplication of numbers and square rooting have the same complexity, i. e. from a program for multiplication one can construct a program for square rooting with the same asymptotic time complexity (1 step≦1 bit-operation) and vice versa. It follows from the Schonhage-Strassen algorithm that square rooting can be performed in 0 (n logn log logn) bit-operations.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
