Phase Transition in Unrestricted Random SAT

Bernd R. Schuh

For random CNF formulae with m clauses, n variables and an unrestricted number of literals per clause the transition from high to low satisfiability can be determined exactly for l…