Implementation of Parallel Boolean Satisfiability Solver by CUDA (Compute Unified Device Architecture)
碩士 === 國立臺灣大學 === 電子工程學研究所 === 99 === Boolean satisfiability (SAT) problem plays a critical role in theoretical and industrial applications. With the advance of SAT solvers in the past 15 years, we are capable to solve fairly large-scale problems. To improve the performance of SAT solvers for much...
Main Authors: | Kung-Ming Lin, 林拱民 |
---|---|
Other Authors: | Chung-Yang (Ric) Huang |
Format: | Others |
Language: | en_US |
Published: |
2011
|
Online Access: | http://ndltd.ncl.edu.tw/handle/53763433686308452413 |
Similar Items
-
Optimization of Boolean satisfiability solver by caching intermediate results
by: S. Vartanov, et al.
Published: (2018-10-01) -
Solving the Boolean satisfiability problem using the parallel paradigm
by: Hoessen, Benoît
Published: (2014) -
Symmetry in Boolean Satisfiability
by: Fadi A. Aloul
Published: (2010-06-01) -
A High Performance Parallel Sparse Linear Equation Solver Using CUDA
by: Martin, Andrew John
Published: (2011) -
Accelerating Boolean Matching for Large Functions on CUDA Platform
by: Feng-Ming Chang, et al.
Published: (2014)