An algorithm for linear programming which requires O(((m+n)n2+(m+n)1.5n)L) arithmetic operations

We present an algorithm for linear programming which requires &Ogr;(((m + n) n2 + (m + n)1.5 n) L) arithmetic operations where m is the number of inequalities, and n is the number of variables. Each operation is performed to a precision of &Ogr; (L) bits. L is bounded by the number of bits in the input.