An algorithm for linear programming which requires O(((m+n)nz+(m+n)1n)) arithmetic operations

We present an algorithm for linear programming which requires Ο(((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 Ο (L) bits. L is bounded by the number of bits in the input.