A tight bound for approximating the square root

DOI10.1016/S0020-0190(97)00126-9zbMath1336.68095OpenAlexW2025228722MaRDI QIDQ287183

Yishay Mansour, Prasoon Tiwari, Nader H. Bshouty, Baruch Schieber

Publication date: 26 May 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(97)00126-9

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

On solving univariate sparse polynomials in logarithmic time

Cites Work

• Unnamed Item
• On the worst-case arithmetic complexity of approximating zeros of polynomials
• Fast exponentiation using the truncation operation
• On the computational power of pushdown automata
• Berechnung und Programm. I
• Lower Bounds for Computations with the Floor Operation
• The Computational Complexity of Continued Fractions

This page was built for publication: A tight bound for approximating the square root