On the complexity of linear programming under finite precision arithmetic (Q1380938): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Some Remarks on the Foundations of Numerical Analysis
+Normal rank
@@ Property / cites work @@
+Incorporating Condition Measures into the Complexity Theory of Linear Programming
+Normal rank
@@ Property / cites work @@
+Ill-Posedness and the Complexity of Deciding Existence of Solutions to Linear Programs
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm, based on Newton's method, for linear programming
+Normal rank
@@ Property / cites work @@
+Q4324980
@@ Property / cites work: Q4324980 / rank @@
+Normal rank
@@ Property / cites work @@
+On the classical logarithmic barrier function method for a class of smooth convex programming problems
+Normal rank
@@ Property / cites work @@
+Interior-point methods for convex programming
@@ Property / cites work: Interior-point methods for convex programming / rank @@
+Normal rank
@@ Property / cites work @@
+Linear programming, complexity theory and elementary functional analysis
+Normal rank
@@ Property / cites work @@
+Q3359644
@@ Property / cites work: Q3359644 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5674306
@@ Property / cites work: Q5674306 / rank @@
+Normal rank
@@ Property / cites work @@
+Some perturbation theory for linear programming
@@ Property / cites work: Some perturbation theory for linear programming / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/bf01582132
+Normal rank
@@ Property / OpenAlex ID @@
+W2039868808
@@ Property / OpenAlex ID: W2039868808 / rank @@
+Normal rank