Phase transitions of the typical algorithmic complexity of the random satisfiability problem studied with linear programming

Here we study linear programming applied to the random K-SAT problem, a fundamental problem in computational complexity. The K-SAT problem is to decide whether a Boolean formula with N variables and structured as a conjunction of M clauses, each being a disjunction of K variables or their negations...

Ausführliche Beschreibung