Complexity Estimates Depending on Condition and Round-Off Error

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

[2]  L. Trefethen,et al.  Numerical linear algebra , 1997 .

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

[4]  Marie-Françoise Roy,et al.  On the combinatorial and algebraic complexity of Quanti erEliminationS , 1994 .

[5]  Michael Shub,et al.  Multihomogeneous Newton methods , 2000, Math. Comput..

[6]  Steve Smale,et al.  Complexity theory and numerical analysis , 1997, Acta Numerica.

[7]  J. H. Wilkinson.  Modern Error Analysis , 1971 .

[8]  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..

[9]  E. Allgower,et al.  Numerical Continuation Methods , 1990 .

[10]  C. D. Meyer,et al.  Generalized inverses of linear transformations , 1979 .

[11]  Dima Grigoriev,et al.  Solving Systems of Polynomial Inequalities in Subexponential Time , 1988, J. Symb. Comput..

[12]  S. Smale,et al.  Complexity of Bezout’s Theorem II Volumes and Probabilities , 1993 .

[13]  Stephen Smale,et al.  Complexity of Bezout's Theorem V: Polynomial Time , 1994, Theor. Comput. Sci..

[14]  S. Smale,et al.  Complexity of Bézout’s theorem. I. Geometric aspects , 1993 .

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

[16]  S. Smale,et al.  Complexity of Bezout's theorem IV: probability of success; extensions , 1996 .

[17]  Joos Heintz,et al.  Sur la complexité du principe de Tarski-Seidenberg , 1989 .

[18]  Stephen Smale,et al.  Complexity of Bezout's Theorem: III. Condition Number and Packing , 1993, J. Complex..

[19]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[20]  José L. Balcázar,et al.  Structural Complexity I , 1995, Texts in Theoretical Computer Science An EATCS Series.

[21]  James Hardy Wilkinson,et al.  Rounding errors in algebraic processes , 1964, IFIP Congress.

[22]  Nicholas J. Higham,et al.  INVERSE PROBLEMS NEWSLETTER , 1991 .