Using BOINC Desktop Grid to Solve Large Scale SAT Problems.

Mikhail Posypkin Alexander A. Semenov Oleg Zaikin

Published in: Comput. Sci. (2012)

Keyphrases

sat problem
satisfiability problem
solving hard
randomly generated
propositional satisfiability
genetic algorithm
phase transition
sat solvers
propositional logic
stochastic local search
data structure
search algorithm
np complete
max sat
sat solving
weighted max sat