"Solving the minimum-cost satisfiability problem using SAT based ..."

Zhaohui Fu, Sharad Malik (2006)

> Home

Details and statistics

DOI: 10.1145/1233501.1233681

access: closed

type: Conference or Workshop Paper

metadata version: 2023-09-30

- view
  authority control:
- export record
  dblp key:
  - conf/iccad/FuM06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iccad/FuM06
Zhaohui Fu, Sharad Malik:
Solving the minimum-cost satisfiability problem using SAT based branch-and-bound search. ICCAD 2006: 852-859

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.