Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
AAIM
/
Paper
Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition.
Yanyan Xu
,
Wei Chen
,
Kaile Su
,
Wenhui Zhang
Venue
C
AAIM
Year
2012
Proceedings
FAW-AAIM
DBLP record
conf/aaim/XuCSZ12 ↗
Browse the full
AAIM paper archive
.