A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF (Q5177339): Difference between revisions

@@ Property / OpenAlex ID @@
+W2963573218
@@ Property / OpenAlex ID: W2963573218 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.6241
@@ Property / arXiv ID: 1403.6241 / rank @@
+Normal rank
@@ Property / cites work @@
+Exotic quantifiers, complexity classes, and complete problems
+Normal rank
@@ Property / cites work @@
+Computing over the reals with addition and order: Higher complexity classes
+Normal rank
@@ Property / cites work @@
+On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
+Normal rank
@@ Property / cites work @@
+\(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\)
@@ Property / cites work: \(P_ \mathbb{R}{}\neq{}NC_ \mathbb{R}\) / rank @@
+Normal rank
@@ Property / cites work @@
+Incorporating Condition Measures into the Complexity Theory of Linear Programming
+Normal rank
@@ Property / cites work @@
+Some perturbation theory for linear programming
@@ Property / cites work: Some perturbation theory for linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+It is possible to know a problem instance is ill-posed? Some foundations for a general theory of condition numbers
+Normal rank
@@ Property / cites work @@
+Fast linear homotopy to find approximate zeros of polynomial systems
+Normal rank
@@ Property / cites work @@
+On a problem posed by Steve Smale
@@ Property / cites work: On a problem posed by Steve Smale / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
+Normal rank
@@ Property / cites work @@
+Smale’s 17th problem: Average polynomial time to compute affine and projective solutions
+Normal rank
@@ Property / cites work @@
+On the Complexity of Numerical Analysis
@@ Property / cites work: On the Complexity of Numerical Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+A new condition number for linear programming
@@ Property / cites work: A new condition number for linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+Coverage processes on spheres and condition numbers for linear programming
+Normal rank
@@ Property / cites work @@
+Computational Complexity and Numerical Stability
@@ Property / cites work: Computational Complexity and Numerical Stability / rank @@
+Normal rank
@@ Property / cites work @@
+Condition
@@ Property / cites work: Condition / rank @@
+Normal rank
@@ Property / cites work @@
+Computing over the reals with addition and order
@@ Property / cites work: Computing over the reals with addition and order / rank @@
+Normal rank
@@ Property / cites work @@
+Computability and complexity theory.
@@ Property / cites work: Computability and complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4864704
@@ Property / cites work: Q4864704 / rank @@
+Normal rank
@@ Property / cites work @@
+Methods of conjugate gradients for solving linear systems
+Normal rank
@@ Property / cites work @@
+Sur la complexité du principe de Tarski-Seidenberg
+Normal rank
@@ Property / cites work @@
+Some Comments from a Numerical Analyst
@@ Property / cites work: Some Comments from a Numerical Analyst / rank @@
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Numerical inverting of matrices of high order
@@ Property / cites work: Numerical inverting of matrices of high order / rank @@
+Normal rank
@@ Property / cites work @@
+The Relaxation Method for Solving Systems of Linear Inequalities
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+ROUNDING-OFF ERRORS IN MATRIX PROCESSES
@@ Property / cites work: ROUNDING-OFF ERRORS IN MATRIX PROCESSES / rank @@
+Normal rank
@@ Property / cites work @@
+Eigenvalues and Condition Numbers of Random Matrices
+Normal rank
@@ Property / cites work @@
+On condition numbers and the distance to the nearest ill-posed problem
+Normal rank
@@ Property / cites work @@
+Some Remarks on the Foundations of Numerical Analysis
+Normal rank
@@ Property / cites work @@
+Two \(P\)-complete problems in the theory of the reals
+Normal rank
@@ Property / cites work @@
+Complexity of Bezout's theorem. V: Polynomial time
+Normal rank
@@ Property / cites work @@
+Complexity estimates depending on condition and round-off error
+Normal rank
@@ Property / cites work @@
+Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
+Normal rank
@@ Property / cites work @@
+A Primal-Dual Algorithm for Solving Polyhedral Conic Systems with a Finite-Precision Machine
+Normal rank
@@ Property / cites work @@
+Complexity of Bezout's theorem. III: Condition number and packing
+Normal rank
@@ Property / cites work @@
+A numerical algorithm for zero counting. II: Distance to ill-posedness and smoothed analysis
+Normal rank
@@ Property / cites work @@
+A numerical algorithm for zero counting. I: Complexity and accuracy
+Normal rank