Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
SAT
/
Paper
Minimum 2CNF Resolution Refutations in Polynomial Time.
Joshua Buresh-Oppenheim
,
David G. Mitchell
Venue
A
SAT
Year
2007
Proceedings
SAT
DBLP record
conf/sat/Buresh-OppenheimM07 ↗
Browse the full
SAT paper archive
.