On the Complexity of Numerical Analysis

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

  • Peter Bro Miltersen
  • Johan Kjeldgaard-Pedersen, Denmark
  • Peter Burgisser, Germany
  • Eric Allender, United States
  • Department of Computer Science
  • Teoretisk naturvidenskab

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 is greater than 0. We show that PosSLP 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.

Original languageEnglish
Title of host publicationProceedings of the 21st Annual IEEE Conference on Computational Complexity
Number of pages9
PublisherIEEE Computer Society Press
Publication year2006
Pages331-339
Publication statusPublished - 2006
EventIEEE Conference on Computational Complexity - Prague, Czech Republic
Duration: 17 Dec 2010 → …
Conference number: 21

Conference

ConferenceIEEE Conference on Computational Complexity
Nummer21
LandCzech Republic
ByPrague
Periode17/12/2010 → …

    Research areas

  • computional complexity, numerical analysis

See relations at Aarhus University Citationformats

ID: 3693549