A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On the Complexity of Numerical Analysis
2009
SIAM journal on computing (Print)
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 divisionfree straight-line program producing an integer N , decide whether N > 0. We show that PosSLP lies in the counting hierarchy, and we show that if A is any language in the Boolean part of P R accepted by a machine whose machine constants are
doi:10.1137/070697926
fatcat:fd6guotj3rehnpehbllcquaii4