A Simple Parallel Algorithm for Finding a Satisfying Truth Assignment to a 2-CNF Formula.

Stephen A. Cook Michael Luby

Published in: Inf. Process. Lett. (1988)

Keyphrases

parallel algorithm
cnf formula
np complete
sat problem
conjunctive normal form
randomly chosen
genetic algorithm
database systems
computational complexity
dynamic programming
phase transition
max sat
truth assignment