The complexity of approximating the square root

The authors prove upper and lower bounds for approximately computing the square root using a given set of operations. The bounds are extended to hold for approximating the kth root, for any fixed k. Several tools from approximation theory are used to prove the lower bound. These include Markoff inequality, Chebyshev polynomials, and a theorem that relates the degree of a rational function to its deviation from the approximated function over a given interval. The lower bound can be generalized to other algebraic functions. The upper bound can be generalized to obtain an O(1)-step straight-line program for evaluating any rational function with integer coefficients at a given integer point.<<ETX>>

[1]  E. Cheney.  Introduction to approximation theory , 1966 .

[2]  Larry J. Stockmeyer,et al.  A Characterization of the Power of Vector Machines , 1976, J. Comput. Syst. Sci..

[3]  Michael Ian Shamos,et al.  Lower bounds from complex function theory , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[4]  Adi Shamir,et al.  Factoring Numbers in O(log n) Arithmetic Steps , 1979, Inf. Process. Lett..

[5]  Nicholas Pippenger.  Computational Complexity of Algebraic Functions , 1981, J. Comput. Syst. Sci..

[6]  Janos Simon.  Division in Idealized Unit Cost RAMS , 1981, J. Comput. Syst. Sci..

[7]  Giancarlo Mauri,et al.  A characterization of the class of functions computable in polynomial time on Random Access Machines , 1981, STOC '81.

[8]  J. Michael Steele,et al.  Lower Bounds for Algebraic Decision Trees , 1982, J. Algorithms.

[9]  Volker Strassen,et al.  The Computational Complexity of Continued Fractions , 1983, SIAM J. Comput..

[10]  Michael Ben-Or,et al.  Lower bounds for algebraic computation trees , 1983, STOC.

[11]  James Renegar,et al.  On the worst-case arithmetic complexity of approximating zeros of polynomials , 1987, J. Complex..

[12]  Baruch Schieber,et al.  Lower bounds for integer greatest common divisor computations , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[13]  Nicholas Pippenger.  Correction to "Computational Complexity of Algebraic Functions" , 1988, J. Comput. Syst. Sci..

[14]  Friedhelm Meyer auf der Heide,et al.  On Computations with Integer Division , 1988, RAIRO Theor. Informatics Appl..

[15]  Baruch Schieber,et al.  Lower Bounds for Computations with the Floor Operation , 1989, SIAM J. Comput..