On the Complexity of Numerical Analysis

Allender, E., Bürgisser, P., Kjeldgaard-Pedersen, J., & Miltersen, P. B. (2009). On the Complexity of Numerical Analysis. SIAM Journal on Computing.

Type

Journal article

Intellectual base

Primary research

Year

2009

DOI

10.1137/070697926

Link

https://doi.org/10.1137/070697926

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.

Registry ID ref:78e1e62c9978 · see in the full table