Boolean satisfiability on a graphics processor.
Kanupriya GulatiSunil P. KhatriPublished in: ACM Great Lakes Symposium on VLSI (2010)
Keyphrases
- boolean satisfiability
- graphics processors
- branch and bound algorithm
- sat solvers
- probabilistic planning
- symmetry breaking
- randomly generated
- boolean optimization
- integer linear programming
- sat problem
- gpu implementation
- parallel algorithm
- phase transition
- max sat
- np complete
- combinatorial problems
- sat instances
- lower bound
- real time
- general purpose
- np hard
- boolean formula
- special case
- constraint programming
- upper bound
- scheduling problem
- evolutionary algorithm
- computational complexity
- genetic algorithm