Approximating linear programming is log-space complete for P (Q750289): Difference between revisions

@@ Property / author @@
-Maria J. Serna
@@ Property / author: Maria J. Serna / rank @@
-Normal rank
@@ Property / author @@
+Maria J. Serna
@@ Property / author: Maria J. Serna / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A taxonomy of problems with fast parallel algorithms
+Normal rank
@@ Property / cites work @@
+Linear programming is log-space hard for P
@@ Property / cites work: Linear programming is log-space hard for P / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of linear programming
@@ Property / cites work: The complexity of linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Q4197641
@@ Property / cites work: Q4197641 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3796746
@@ Property / cites work: Q3796746 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4051879
@@ Property / cites work: Q4051879 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3484351
@@ Property / cites work: Q3484351 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(91)90194-m
+Normal rank
@@ Property / OpenAlex ID @@
+W2029091075
@@ Property / OpenAlex ID: W2029091075 / rank @@
+Normal rank