2006 |
12 | EE | James Renegar:
Hyperbolic Programs, and Their Derivative Relaxations.
Foundations of Computational Mathematics 6(1): 59-79 (2006) |
2005 |
11 | EE | Lenore Blum,
Felipe Cucker,
Tomaso Poggio,
James Renegar,
Michael Shub:
Foreword.
Foundations of Computational Mathematics 5(4): 349 (2005) |
1994 |
10 | EE | James Renegar:
Is It Possible to Know a Problem Instance Is Ill-Posed?: Some Foundations for a General Theory of Condition Numbers.
J. Complexity 10(1): 1-56 (1994) |
9 | | James Renegar:
Some perturbation theory for linear programming.
Math. Program. 65: 73-91 (1994) |
1992 |
8 | | James Renegar:
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.
J. Symb. Comput. 13(3): 255-300 (1992) |
7 | | James Renegar:
On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part II: The General Decision Problem. Preliminaries for Quantifier Elimination.
J. Symb. Comput. 13(3): 301-328 (1992) |
6 | | James Renegar:
On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part III: Quantifier Elimination.
J. Symb. Comput. 13(3): 329-352 (1992) |
5 | | James Renegar,
Michael Shub:
Unified complexity analysis for Newton LP methods.
Math. Program. 53: 1-16 (1992) |
4 | | James Renegar:
On the Computational Complexity of Approximating Solutions for Real Algebraic Formulae.
SIAM J. Comput. 21(6): 1008-1025 (1992) |
1989 |
3 | | James Renegar:
On the Worst-Case Arithmetic Complexity of Approximating Zeros of Systems of Polynomials.
SIAM J. Comput. 18(2): 350-370 (1989) |
1988 |
2 | | James Renegar:
A Faster PSPACE Algorithm for Deciding the Existential Theory of the Reals
FOCS 1988: 291-295 |
1987 |
1 | EE | James Renegar:
On the worst-case arithmetic complexity of approximating zeros of polynomials.
J. Complexity 3(2): 90-113 (1987) |