21 citations · 26 across the 3 of their papers we have counts for
5 papers
Spontaneous symmetry breaking of active phase in coevolving nonlinear voter model
Arkadiusz Jędrzejewski, Joanna Toruniewska, Krzysztof Suchecki +2
We study an adaptive network model driven by a nonlinear voter dynamics. Each node in the network represents a voter and can be in one of two states that correspond to different op…
On Cryptographic Attacks Using Backdoors for SAT
Alexander Semenov, Oleg Zaikin, Ilya Otpuschennikov +2
Propositional satisfiability (SAT) is at the nucleus of state-of-the-art approaches to a variety of computationally hard problems, one of which is cryptanalysis. Moreover, a number…
Fast Algorithm for Enumerating Diagonal Latin Squares of Small Order
Stepan Kochemazov, Eduard Vatutin, Oleg Zaikin
In this paper we propose an algorithm for enumerating diagonal Latin squares of small order. It relies on specific properties of diagonal Latin squares to employ symmetry breaking…
Encoding Cryptographic Functions to SAT Using Transalg System
Ilya Otpuschennikov, Alexander Semenov, Irina Gribanova +2
In this paper we propose the technology for constructing propositional encodings of discrete functions. It is aimed at solving inversion problems of considered functions using stat…
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…