Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
ICCAD
/
Paper
Solving the minimum-cost satisfiability problem using SAT based branch-and-bound search.
Zhaohui Fu
,
Sharad Malik
Venue
A
ICCAD
Year
2006
Proceedings
ICCAD
DBLP record
conf/iccad/FuM06 ↗
Browse the full
ICCAD paper archive
.