Repository logo

Browsing by Subject "Boolean satisfiability problem (SAT)"

Filter results by typing the first few letters
Now showing 1 - 1 of 1
  • thumbnail.journal.alt
    Item type:Article, Access status: Open Access ,
    Using BOINC desktop grid to solve large scale SAT problems
    (Wydawnictwa AGH, 2012) Posypkin, Mihail Anatol'evič; Semënov, Aleksandr Anatol'evič; Zaikin, Oleg
    Many practically important combinatorial problems can be efficiently reduced to a problem of Boolean satisfiability (SAT). Therefore, the implementation of distributed algorithms for solving SAT problems is of great importance. In this article we describe a technology for organizing desktop grid, which is meant for solving SAT problems. This technology was implemented in the form of a volunteer computing project SAT@home based on a popular BOINC platform.