[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract.

We consider arithmetic expressions over operators + , - , * , / , and \(\sqrt[k]\) , with integer operands. For an expression E having value ξ , a separation bound sep (E) is a positive real number with the property that ξ\neq 0 implies |ξ| \geq sep (E) . We propose a new separation bound that is easy to compute and stronger than previous bounds.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received February 24, 1997; revised August 3, 1998.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Burnikel, C., Fleischer, R., Mehlhorn, K. et al. A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals. Algorithmica 27, 87–99 (2000). https://doi.org/10.1007/s004530010005

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004530010005

Navigation