Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
SODA
/
Paper
Solving random satisfiable 3CNF formulas in expected polynomial time.
Michael Krivelevich
,
Dan Vilenchik
Venue
A*
SODA
Year
2006
Proceedings
SODA
DBLP record
conf/soda/KrivelevichV06 ↗
Browse the full
SODA paper archive
.