Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
SAT
/
Paper
Exponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas.
Dimitris Achlioptas
,
Ricardo Menchaca-Mndez
Venue
A
SAT
Year
2012
Proceedings
SAT
DBLP record
conf/sat/AchlioptasM12 ↗
Browse the full
SAT paper archive
.