Search the dblp DataBase

Publications of Author

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