Sciweavers

SAT
2004
Springer
117views Hardware» more  SAT 2004»
13 years 10 months ago
A Random Constraint Satisfaction Problem That Seems Hard for DPLL
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...
Harold S. Connamacher