On the Complexity of Numerical Analysis

Authors:
Eric Allender;Peter Burgisser;Johan Kjeldgaard-Pedersen;Peter Bro Miltersen
Affiliations:
Rutgers, the State University of NJ, USA;Paderborn University, Germany;Decision Sciences Practice, Denmark;University of Aarhus, Denmark
Venue:
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Year:
2006

Citing 0
Cited 17

The complexity of two problems on arithmetic circuits

Theoretical Computer Science
Characterizing Valiant's algebraic complexity classes

Journal of Complexity
Theory of Real Computation According to EGC

Reliable Implementation of Real Number Algorithms: Theory and Practice
Automata, Probability, and Recursion

CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
On Faster Integer Calculations Using Non-arithmetic Primitives

UC '08 Proceedings of the 7th international conference on Unconventional Computing
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations

Journal of the ACM (JACM)
The Complexity of Nash Equilibria in Simple Stochastic Multiplayer Games

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
On defining integers in the counting hierarchy and proving arithmetic circuit lower bounds

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Decision problems for Nash equilibria in stochastic games

CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Cracks in the defenses: scouting out approaches on circuit lower bounds

CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
On probabilistic parallel programs with process creation and synchronisation

TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Recursive concurrent stochastic games

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Survey: Equilibria, fixed points, and complexity classes

Computer Science Review
Model checking stochastic branching processes

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Size Constrained Distance Clustering: Separation Properties and Some Complexity Results

Fundamenta Informaticae - From Physics to Computer Science: to Gianpiero Cattaneo for his 70th birthday
Exotic quantifiers, complexity classes, and complete problems

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Data exchange with arithmetic operations

Proceedings of the 16th International Conference on Extending Database Technology

Quantified Score

Hi-index	0.00

Visualization

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 gt 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.