Skip to main content


eCommons@Cornell

eCommons@Cornell >

Browsing by Author Renegar, J.

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:   
Sort by: In order: Results/Page Authors/Record:
Showing results 1 to 17 of 17
PreviewIssue DateTitleAuthor(s)
Sep-1990Computational complexity of solving real algebraic formulaeRenegar, J.
Sep-1994Condition Numbers, the Barrier Method and the Conjugate Gradient MethodRenegar, J.
Apr-1988A Faster PSPACE Algorithm for Deciding the Existential Theory of the RealsRenegar, J.
Mar-2004Hyperbolic Programs, and Their Derivative RelaxationsRenegar, J.
May-1992Incorporating Condition Measures into the Complexity Theory of Linear ProgrammingRenegar, J.
Apr-1994Incorporating Condition Measures into the Complexity Theory of Linear ProgrammingRenegar, J.
Oct-1990Is it possible to know a problem instance is ill-posed? Some foundations for a general theory of condition numbersRenegar, J.
Apr-1994Linear Programming, Complexity Theory and Elementary Functional AnalysisRenegar, J.
Jan-1993Notes on the Efficiency of the Barrier MethodRenegar, J.
Jul-1989On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part IRenegar, J.
Jul-1989On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part IIRenegar, J.
Aug-1989On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part IIIRenegar, J.
Aug-1989On the Computational Complexity of Approximating Solutions for Real Algebraic FormulaeRenegar, J.
May-1987On the Worst Case Arithmetic Complexity of Approximating Zeros of Systems of PolynomialsRenegar, J.
Feb-1991Recent progress on the complexity of the decision problem for the realsRenegar, J.
Jan-1993Some Perturbation Theory for Linear ProgrammingRenegar, J.
Jun-1988Unified Complexity Analysis for Newton LP MethodsRenegar, J.; Shub, M.
Showing results 1 to 17 of 17

 

© 2014 Cornell University Library Contact Us