Solving SAT Problem by Pseudo-Boolean Optimization Engine
碩士 === 國立臺灣大學 === 電子工程學研究所 === 96 === Boolean satisfiability (SAT) problem is a well-known problem with many applications in the field of VLSI Computer-Aided Design. In recent years, dramatic improvements in SAT solver help us to solve instances more efficiently. In this thesis, we propose a novel i...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/33668600551550318960 |