Reducing the Parallel Complexity of Certain Linear Programming Problems (Extended Abstract)


We study the parallel complexity of solving linear programming problems in the context of interior point methods. Let n and m respectively denote the number of variables and the number of constraints in the given problem. We give an algorithm that solves linear programming problems in O( ( ~ n n ) ' / ~ ( l ~ g m ) ~ L ) time using O ( M ( n ) m / n + n3… (More)
DOI: 10.1109/FSCS.1990.89579


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics