A Theory of NP-completeness and Ill-conditioning for Approximate Real Computations

We develop a complexity theory for approximate real computations. We first produce a theory for exact computations but with condition numbers. The input size depends on a condition number, which is not assumed known by the machine. The theory admits deterministic and nondeterministic polynomial time recognizable problems. We prove that P is not NP in this theory if and only if P is not NP in the BSS theory over the reals. Then we develop a theory with weak and strong approximate computations. This theory is intended to model actual numerical computations that are usually performed in floating point arithmetic. It admits classes P and NP and also an NP-complete problem. We relate the P vs. NP question in this new theory to the classical P vs. NP problem.

[1]  Jean-Michel Muller,et al.  Tight and Rigorous Error Bounds for Basic Building Blocks of Double-Word Arithmetic , 2017, ACM Trans. Math. Softw..

[2]  Felipe Cucker,et al.  Two P-complete problems in the theory of the reals , 1992, J. Complex..

[3]  M. Berger.  A Panoramic View of Riemannian Geometry , 2003 .

[4]  J. Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I , 1989 .

[5]  D. S. Arnon,et al.  Algorithms in real algebraic geometry , 1988 .

[6]  Felipe Cucker,et al.  A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF , 2014, Forum of Mathematics, Sigma.

[7]  Jianer Chen,et al.  On Parameterized Intractability: Hardness and Completeness , 2008, Comput. J..

[8]  A. Turing.  ROUNDING-OFF ERRORS IN MATRIX PROCESSES , 1948 .

[9]  Douglas M. Priest.  On properties of floating point arithmetics: numerical stability and the cost of accurate computations , 1992 .

[10]  James Renegar.  On the computational complexity and geome-try of the first-order theory of the reals , 1992 .

[11]  Mark Braverman,et al.  Computability of Julia Sets , 2009, Algorithms and computation in mathematics.

[12]  James Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I: Introduction. Preliminaries. The Geometry of Semi-Algebraic Sets. The Decision Problem for the Existential Theory of the Reals , 1992, J. Symb. Comput..

[13]  Jean-Michel Muller,et al.  Handbook of Floating-Point Arithmetic (2nd Ed.) , 2018 .

[14]  Mark Braverman,et al.  Computing over the Reals: Foundations for Scientific Computing , 2005, ArXiv.

[15]  Preface.  A Panoramic View of Riemannian Geometry , 2003 .

[16]  Felipe Cucker,et al.  Complexity estimates depending on condition and round-off error , 1998, JACM.

[17]  S. Basu,et al.  Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics) , 2006 .

[18]  Jean-Michel Muller,et al.  Handbook of Floating-Point Arithmetic (2nd Ed.) , 2018 .

[19]  M. Gromov.  Metric Structures for Riemannian and Non-Riemannian Spaces , 1999 .

[20]  Lenore Blum,et al.  Complexity and Real Computation , 1997, Springer New York.

[21]  S. Smale,et al.  On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[22]  Richard P. Brent.  Fast multiple-precision evaluation of elementary functions (1976) , 2016 .

[23]  Richard P. Brent,et al.  Fast Multiple-Precision Evaluation of Elementary Functions , 1976, JACM.