Solving Satisfiability Problems on FPGAs.
Takayuki SuyamaMakoto YokooHiroshi SawadaPublished in: FPL (1996)
Keyphrases
- satisfiability problem
- solving hard
- stochastic local search
- np complete
- sat instances
- finite domain
- temporal logic
- search algorithm
- phase transition
- graph coloring problems
- search problems
- davis putnam
- sat problem
- davis putnam logemann loveland
- pspace complete
- stochastic local search algorithms
- max sat
- mazurkiewicz traces
- constraint programming
- model checking
- random sat
- combinatorial problems
- field programmable gate array
- combinatorial optimization
- propositional logic
- heuristic search
- orders of magnitude
- evolutionary algorithm
- knowledge base
- search space