Application of Graph Automorphism on Improving SAT Solver Performance
碩士 === 國立臺灣大學 === 電子工程學研究所 === 99 === NP-complete problems are often seen in different areas, but there is no proof showing NP equals P up to present and thus no polynomial time algorithms exist to give an optimal solution for NP-complete problems. Among all NP-complete problems, Boolean satisfiabil...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2011
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/35775410768472944792 |