46 citations · 48 across the 4 of their papers we have counts for
4 papers
Decomposing Hard SAT Instances with Metaheuristic Optimization
Daniil Chivilikhin, Artem Pavlenko, Alexander Semenov
In the article, within the framework of the Boolean Satisfiability problem (SAT), the problem of estimating the hardness of specific Boolean formulas w.r.t. a specific complete SAT…
Estimating the hardness of SAT encodings for Logical Equivalence Checking of Boolean circuits
Alexander Semenov, Konstantin Chukharev, Egor Tarasov +2
In this paper we investigate how to estimate the hardness of Boolean satisfiability (SAT) encodings for the Logical Equivalence Checking problem (LEC). Meaningful estimates of hard…
MoG-VQE: Multiobjective genetic variational quantum eigensolver
D. Chivilikhin, A. Samarin, V. Ulyantsev +3
Variational quantum eigensolver (VQE) emerged as a first practical algorithm for near-term quantum computers. Its success largely relies on the chosen variational ansatz, correspon…
fbSAT: Automatic Inference of Minimal Finite-State Models of Function Blocks Using SAT Solver
Konstantin Chukharev, Daniil Chivilikhin
Finite-state models are widely used in software engineering, especially in control systems development. Commonly, in control applications such models are developed manually, hence,…