"A Random Constraint Satisfaction Problem That Seems Hard for DPLL."

Harold S. Connamacher (2004)
a service of Schloss Dagstuhl - Leibniz Center for Informatics