An Improved Bound on Sums of Square Roots via the Subspace Theorem

F. Eisenbrand, M. H., & Singer, N. (2024). An Improved Bound on Sums of Square Roots via the Subspace Theorem. 40th International Symposium on Computational Geometry (SoCG 2024).

Type

Preprint

Intellectual base

Grey literature

Year

2024

DOI

10.4230/lipics.socg.2024.54

Link

https://doi.org/10.4230/LIPIcs.SoCG.2024.54

Cited by

1 citation across 1 artifact.

Domain-specific

• Square-Root Sum Problem
  • A counting-hierarchy containment is known for the standard Square-Root Sum problem, and hence a PSPACE upper bound follows, but no comparable nontrivial lower-bound classification is known.

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.

Links previously used in the corpus

Before the registry existed this work was also linked 1 other way.

• https://arxiv.org/abs/2312.02057 ×1

Registry ID ref:d58b7c0aa74d · see in the full table