Parallel Algorithms for Satisfiability (SAT) Problem.
Jun GuPublished in: Parallel Processing of Discrete Optimization Problems (1994)
Keyphrases
- parallel algorithm
- sat problem
- satisfiability problem
- np complete
- phase transition
- constraint satisfaction problems
- sat solvers
- randomly generated
- sat solving
- max sat
- sat instances
- propositional satisfiability
- boolean satisfiability
- parallel computation
- parallel programming
- shared memory
- decision problems
- constraint satisfaction
- cnf formula
- davis putnam
- stochastic local search
- branch and bound
- parallel implementations
- search algorithm
- random sat
- temporal logic
- processor array
- pc cluster
- clause learning
- boolean formula
- search space
- lower bound