Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
SAT
/
Paper
Efficient CNF Simplification Based on Binary Implication Graphs.
Marijn Heule
,
Matti Jrvisalo
,
Armin Biere
Venue
A
SAT
Year
2011
Proceedings
SAT
DBLP record
conf/sat/HeuleJB11 ↗
Browse the full
SAT paper archive
.