Aarhus University Seal / Aarhus Universitets segl

On the complexity of numerical analysis

Research output: Contribution to journal/Conference contribution in journal/Contribution to newspaperJournal articleResearchpeer-review

  • Peter Bro Miltersen
  • Eric Allender, Rutgers, the State University of NJ, United States
  • Peter Burgisser, Paderborn University, Germany
  • Johan Kjeldgaard-Pedersen, PA Consulting Group, Denmark
  • Department of Computer Science

We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis:

• The Blum-Shub-Smale model of computation over the reals.

• A problem we call the “Generic Task of Numerical Computation,” which captures an aspect of doing numerical computation in floating point, similar to the “long exponent model” that has been studied in the numerical computing community.

We show that both of these approaches hinge on the question of understanding the complexity of the following problem, which we call PosSLP: Given a division-free straight-line program producing an integer N, decide whether N>0.

• In the Blum-Shub-Smale model, polynomial time computation over the reals (on discrete inputs) is polynomial-time equivalent to PosSLP, when there are only algebraic constants. We conjecture that using transcendental constants provides no additional power, beyond nonuniform reductions to PosSLP, and we present some preliminary results supporting this conjecture.

• The Generic Task of Numerical Computation is also polynomial-time equivalent to PosSLP.

We prove that PosSLP lies in the counting hierarchy. Combining this with work of Tiwari, we obtain that the Euclidean Traveling Salesman Problem lies in the counting hierarchy – the previous best upper bound for this important problem (in terms of classical complexity classes) being PSPACE. In the course of developing the context for our results on arithmetic circuits, we present some new observations on the complexity of ACIT: the Arithmetic Circuit Identity Testing problem. In particular, we show that if n! is not ultimately easy, then ACIT has subexponential complexity.

Original languageEnglish
JournalS I A M Journal on Computing
Volume38
Issue5
Pages (from-to)1987-2006
Number of pages19
ISSN0097-5397
DOIs
Publication statusPublished - 2009

    Research areas

  • interval graphs, profile minimization, edge completion, FPT algorithm, branching

See relations at Aarhus University Citationformats

ID: 15208001