DagSemProc.06111.12.pdf
- Filesize: 184 kB
- 9 pages
Document
On the Complexity of Numerical Analysis
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 6111
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2006-11-20
Cite AsGet 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
https://doi.org/10.4230/DagSemProc.06111.12
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.
Keywords
- Blum-Shub-Smale Model
- Euclidean Traveling Salesman Problem
- Counting Hierarchy
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads