21 citations · 71 across the 12 of their papers we have counts for
3 papers · 1 filter
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…
Using synchronous Boolean networks to model several phenomena of collective behavior
Stepan Kochemazov, Alexander Semenov
In this paper, we propose an approach for modeling and analysis of a number of phenomena of collective behavior. By collectives we mean multi-agent systems that transition from one…
Transalg: a Tool for Translating Procedural Descriptions of Discrete Functions to SAT
Ilya Otpuschennikov, Alexander Semenov, Stepan Kochemazov
In this paper we present the Transalg system, designed to produce SAT encodings for discrete functions, written as programs in a specific language. Translation of such programs to…