SAT@home: Difference between revisions

Line 35:

}}

'''SAT@home''' is a [[wikipedia:volunteer computing|volunteer computing]] project built on the [[wikipedia:BOINC|BOINC]] platform, dedicated to solving hard combinatorial problems that can be reduced to instances of the [[wikipedia:Boolean satisfiability problem|Boolean satisfiability problem]] (SAT).<ref name="zaikin2019">{{Cite conference

'''[https://web.archive.org/web/20180829063323/http://sat.isa.ru/pdsat/ SAT@home]''' is a [[wikipedia:volunteer computing|volunteer computing]] project built on the [[wikipedia:BOINC|BOINC]] platform, dedicated to solving hard combinatorial problems that can be reduced to instances of the [[wikipedia:Boolean satisfiability problem|Boolean satisfiability problem]] (SAT).<ref name="zaikin2019">{{Cite conference

|last1=Zaikin |first1=Oleg

|title=SAT-Based Cryptanalysis: From Parallel Computing to Volunteer Computing

Line 112:

=== Diagonal Latin squares ===

[[File:Idgf.png|left|frameless]]

[[File:Sudoku.jpg|thumb|right|A completed [[wikipedia:Sudoku|Sudoku]] grid is a special case of a Latin square. SAT@home volunteers searched for diagonal Latin squares of order 10, a much harder combinatorial target.]]

@@ Line 35: / Line 35: @@
 }}
-'''SAT@home''' is a [[wikipedia:volunteer computing|volunteer computing]] project built on the [[wikipedia:BOINC|BOINC]] platform, dedicated to solving hard combinatorial problems that can be reduced to instances of the [[wikipedia:Boolean satisfiability problem|Boolean satisfiability problem]] (SAT).<ref name="zaikin2019">{{Cite conference
+'''[https://web.archive.org/web/20180829063323/http://sat.isa.ru/pdsat/ SAT@home]''' is a [[wikipedia:volunteer computing|volunteer computing]] project built on the [[wikipedia:BOINC|BOINC]] platform, dedicated to solving hard combinatorial problems that can be reduced to instances of the [[wikipedia:Boolean satisfiability problem|Boolean satisfiability problem]] (SAT).<ref name="zaikin2019">{{Cite conference
   |last1=Zaikin |first1=Oleg
   |title=SAT-Based Cryptanalysis: From Parallel Computing to Volunteer Computing
@@ Line 112: / Line 112: @@
 === Diagonal Latin squares ===
+[[File:Idgf.png|left|frameless]]
 [[File:Sudoku.jpg|thumb|right|A completed [[wikipedia:Sudoku|Sudoku]] grid is a special case of a Latin square. SAT@home volunteers searched for diagonal Latin squares of order 10, a much harder combinatorial target.]]