1. MaxSAT, hard and soft constraints;Li,2009
2. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties;Ausiello,2003
3. The threshold for random k-SAT is 2klog2−O(k);Achlioptas;J. Amer. Math. Soc.,2004
4. Mick gets some (the odds are on his side) [satisfiability];Chvátal,1992
5. The asymptotic k-sat threshold;Coja-Oghlan,2014