SAT@home is a research project that uses Internet-connected computers to solve hard and practically important problems (discrete functions inversion problems, discrete optimization, bioinformatics, etc) that can be effectively reduced to SAT
. Currently in the project problems of inversion of some cryptographic functions used in keystream generators are being solved. All cryptographic algorithms under investigation are publicly available. Corresponding tasks are randomly generated and do not contain any confidential information. We also plan to publish obtained results. In the nearest future we are going to launch an experiment for solving Quadratic Assignment problem
(as a SAT problem) within the project. In Computer Science Satisfiability
(SAT) is the problem of determining if the variables of a given Boolian formula can be assigned in such a way as to make the formula evaluate to TRUE.
Home Page: http://sat.isa.ru/pdsat/
The project is run by the Institute for Systems Analysis of Russian Academy of Sciences, department of Distributed Computing.
The project was launched on Sep 29, 2011 and is Active.
The project supports the following Applications:Windows 32 bit,Linux 32 bit.
View detailed information on our Team Here
Current Team Scores: