An Approach for Solving Large SAT Problems on FPGA.
Kenji KanazawaTsutomu MaruyamaPublished in: ACM Trans. Reconfigurable Technol. Syst. (2010)
Keyphrases
- sat problem
- sat solving
- sat instances
- np complete problems
- solving hard
- satisfiability problem
- stochastic local search
- sat solvers
- np complete
- phase transition
- systematic search algorithms
- constraint satisfaction problems
- max sat
- boolean satisfiability
- hybrid algorithms
- random sat
- randomly generated
- propositional satisfiability
- weighted max sat
- graph coloring
- hardware implementation
- random sat instances
- search problems
- sat encodings
- backtracking search
- sufficient conditions