Using BOINC desktop grid to solve large scale SAT problems
Mikhail Anatol'evich Posypkin, Alexander Sergueevich Semenov, Олег Сергеевич Заикин · Computer Science · 2012
Many practically important combinatorial problems can be efficiently reducedto a problem of Boolean satisfiability (SAT). Therefore, the implementation ofdistributed algorithms for solving SAT problems is of great importance. In thisarticle we describe a technology for organizing desktop grid, which is meantfor solving SAT problems. This technology was implemented in the form ofa volunteer computing project SAT@home based on a popular BOINC platform.