|
|
eCommons@Cornell >
Browsing by Author Renegar, J.
Showing results 1 to 17 of 17
| Preview | Issue Date | Title | Author(s) | | Sep-1990 | Computational complexity of solving real algebraic formulae | Renegar, J. |
| Sep-1994 | Condition Numbers, the Barrier Method and the Conjugate Gradient Method | Renegar, J. |
| Apr-1988 | A Faster PSPACE Algorithm for Deciding the Existential Theory of the Reals | Renegar, J. |
| Mar-2004 | Hyperbolic Programs, and Their Derivative Relaxations | Renegar, J. |
| Apr-1994 | Incorporating Condition Measures into the Complexity Theory of Linear Programming | Renegar, J. |
| May-1992 | Incorporating Condition Measures into the Complexity Theory of Linear Programming | Renegar, J. |
| Oct-1990 | Is it possible to know a problem instance is ill-posed? Some foundations for a general theory of condition numbers | Renegar, J. |
| Apr-1994 | Linear Programming, Complexity Theory and Elementary Functional Analysis | Renegar, J. |
| Jan-1993 | Notes on the Efficiency of the Barrier Method | Renegar, J. |
| Jul-1989 | On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I | Renegar, J. |
| Jul-1989 | On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part II | Renegar, J. |
| Aug-1989 | On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part III | Renegar, J. |
| Aug-1989 | On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae | Renegar, J. |
| May-1987 | On the Worst Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials | Renegar, J. |
| Feb-1991 | Recent progress on the complexity of the decision problem for the reals | Renegar, J. |
| Jan-1993 | Some Perturbation Theory for Linear Programming | Renegar, J. |
| Jun-1988 | Unified Complexity Analysis for Newton LP Methods | Renegar, J.; Shub, M. |
Showing results 1 to 17 of 17
|
