On the r,s satisfiability problem and a conjecture of Tovey

Computing unsatisfiable k-SAT instances with few occurrences per variable

Theoretical Computer Science

Note: Computational complexity of some restricted instances of 3-SAT

Discrete Applied Mathematics

A new lower bound of critical function for (k,s)-SAT

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation

The local lemma is tight for SAT

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms