A polynomial time algorithm for solving systems of linear inequalities with two variables per inequality

Authors:
Bengt Aspvall;Yossi Shiloach
Affiliations:
-;-
Venue:
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Year:
1979

Citing 0
Cited 5

On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope

AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Linear programming

Algorithms and theory of computation handbook
Fast convergence of natural bargaining dynamics in exchange networks

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Determinacy analysis for logic programs using mode and type information

LOPSTR'04 Proceedings of the 14th international conference on Logic Based Program Synthesis and Transformation
Validation of protocols with temporal constraints

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a constructive algorithm for solving systems of linear inequalities (LI) with at most two variables per inequality. The algorithm is polynomial in the size of the input. The LI problem is of importance in complexity theory since it is polynomial time (Turing) equivalent to linear programming. The subclass of LI treated in this paper is also of practical interest in mechanical verification systems, and we believe that the ideas presented can be extended to the general LI problem.