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

Burnikel, C., Fleischer, R., Mehlhorn, K., & Schirra, S. (2000). A Strong and Easily Computable Separation Bound for Arithmetic Expressions Involving Radicals. Algorithmica.

Type

Journal article

Intellectual base

Primary research

Year

2000

DOI

10.1007/s004530010005

Link

https://doi.org/10.1007/s004530010005

Cited by

1 citation across 1 artifact.

Domain-specific

• Square-Root Sum Problem
  • A separation bound gives a lower bound on \(|E|\) conditional on \(E\ne0\); its bit length becomes an upper bound on the precision needed for a certified sign decision.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:9649565a2488 · see in the full table