How Much Precision Is Needed to Compare Two Sums of Square Roots of Integers?

Qian, J., & Wang, C. A. (2006). How Much Precision Is Needed to Compare Two Sums of Square Roots of Integers?. Information Processing Letters.

Type

Journal article

Intellectual base

Primary research

Year

2006

DOI

10.1016/j.ipl.2006.05.002

Link

https://doi.org/10.1016/j.ipl.2006.05.002

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:b95f52e3cbf0 · see in the full table