A Linear Time Parallel Algorithm for the 2-CNF Satisfiability Problem.
El-Sayed M. El-HorbatyPublished in: Egypt. Comput. Sci. J. (2000)
Keyphrases
- parallel algorithm
- satisfiability problem
- conjunctive normal form
- sat instances
- np complete
- sat problem
- clause learning
- temporal logic
- stochastic local search
- search algorithm
- phase transition
- parallel computation
- cnf formula
- stochastic local search algorithms
- boolean functions
- max sat
- shared memory
- sat solvers
- parallel implementations
- cluster of workstations
- knowledge compilation
- propositional satisfiability
- model checking
- boolean formula
- conjunctive queries
- polynomial size
- medial axis transform