Harold S. Connamacher A Random Constraint Satisfaction Problem That Seems Hard for DPLL. 2004 conf/sat/2004 SAT http://www.satisfiability.org/SAT04/programme/11.pdf db/conf/sat/sat2004.html#Connamacher04