A simple constructive algorithm for the evaluation of formulas having two literals per clause, which runs in linear time on a random access machine.Expand

It is straightforward to show that NR(2)SAT is NP-complete, and whether a given CNF expression can be transformed into an equivalent NR(1) expression with at most a polynomial increase in the length of the expression is determined.Expand

A constructive algorithm for solving systems of linear inequalities (LI) with at most two variables per inequality with time complexity O(mn^3 I) on a random access machine.Expand

A constructive algorithm for solving systems of linear inequalities (LI) with at most two variables per inequality with polynomial in the size of the input is presented.Expand

Determining whether the vertices of a graph can be colored using $k$ different colors so that no two adjacent vertices receive the same color is a well-known NP-complete problem. Graph coloring is… Expand

A rule for optimally selecting m among n scheduled projects under discounting is demonstrated, which applies to situations of restricted choice in sequential developments of resource deposits.Expand

L. G. Khachiyan's polynomial time algorithm for determining whether a system of linear inequalities is satisfiable is presented together with a proof of its validity and can be used to solve linear programs in polynometric time.Expand

The general block distribution of a matrix is a rectilinear partition of the matrix into orthogonal blocks such that the maximum sum of the elements within a single block is minimized. This… Expand

This report contains two papers inspired by the "dinner table problem": If n people are seated randomly around a circular table for two meals, what is the probability that no two people sit together… Expand