论文信息 - A Tight Bound for Approximating the Square Root - 字舞流文

A Tight Bound for Approximating the Square Root

Baruch Schieber | Yishay Mansour | Nader H. Bshouty | Prasoon Tiwari | Y. Mansour | B. Schieber | Prasoon Tiwari | N. Bshouty

[1] Baruch Schieber,et al. The complexity of approximating the square root , 1989, 30th Annual Symposium on Foundations of Computer Science.

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

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

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

[5] Volker Strassen,et al. The computational complexity of continued fractions , 1981, SYMSAC '81.

[6] Arnold Schönhage,et al. On the Power of Random Access Machines , 1979, ICALP.

[7] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .