Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
SAT
/
Paper
A Random Constraint Satisfaction Problem That Seems Hard for DPLL.
Harold S. Connamacher
Venue
A
SAT
Year
2004
Proceedings
SAT
DBLP record
conf/sat/Connamacher04 ↗
Browse the full
SAT paper archive
.