2 citations · 5 across the 14 of their papers we have counts for
1 paper · 2 filters
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…