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

Authors:
P. M. Vaidya
Affiliations:
AT&T Bell Laborarorier, Murray Hill, New Jersey
Venue:
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Year:
1987

Citing 3
Cited 7

A new polynomial-time algorithm for linear programming

Combinatorica
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
The algebraic eigenvalue problem

The algebraic eigenvalue problem

Detecting cycles in dynamic graphs in polynomial time

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
An Analysis of Zero-Clairvoyant Scheduling

TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A method for metric temporal reasoning

Eighteenth national conference on Artificial intelligence
Bayesian compressive sensing via belief propagation

IEEE Transactions on Signal Processing
Decomposition Construction for Secret Sharing Schemes with Graph Access Structures in Polynomial Time

SIAM Journal on Discrete Mathematics
A complexity perspective on entailment of parameterized linear constraints

Constraints
Note: On the complexity of quantified linear systems

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.