21 citations · 67 across the 10 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2014
Using Volunteer Computing for Mounting SAT-based Cryptographic Attacks
Alexander Semenov, Oleg Zaikin, Ilya Otpuschennikov
In this paper we describe the volunteer computing project SAT@home, developed and maintained by us. This project is aimed at solving hard instances of the Boolean satisfiability pr…
cs.DC2011★ 4 cited
Parallel algorithms for SAT in application to inversion problems of some discrete functions
Alexander Semenov, Oleg Zaikin, Dmitry Bespalov +1
In this article we consider the inversion problem for polynomially computable discrete functions. These functions describe behavior of many discrete systems and are used in model c…