Document Open Access Logo

On the Complexity of Numerical Analysis

Authors Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen

PDF

File

Thumbnail PDF
PDF
DagSemProc.06111.12.pdf
  • Filesize: 184 kB
  • 9 pages

Document Identifiers

Subject Classification

Keywords
  • Blum-Shub-Smale Model
  • Euclidean Traveling Salesman Problem
  • Counting Hierarchy

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis.  We show that both 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. We show that OrdSlp lies in the counting hierarchy, and combining our results with work of Tiwari, we show 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.

Cite As Get BibTex

Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, and Peter Bro Miltersen. On the Complexity of Numerical Analysis. In Complexity of Boolean Functions. Dagstuhl Seminar Proceedings, Volume 6111, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006) https://doi.org/10.4230/DagSemProc.06111.12

Author Details

Eric Allender
Peter Bürgisser
Johan Kjeldgaard-Pedersen
Peter Bro Miltersen
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact