Picture for Alexander Semenov

Alexander Semenov

Decomposing Hard SAT Instances with Metaheuristic Optimization

Add code
Dec 16, 2023
Viaarxiv icon

Estimating the hardness of SAT encodings for Logical Equivalence Checking of Boolean circuits

Add code
Oct 04, 2022
Figure 1 for Estimating the hardness of SAT encodings for Logical Equivalence Checking of Boolean circuits
Figure 2 for Estimating the hardness of SAT encodings for Logical Equivalence Checking of Boolean circuits
Figure 3 for Estimating the hardness of SAT encodings for Logical Equivalence Checking of Boolean circuits
Figure 4 for Estimating the hardness of SAT encodings for Logical Equivalence Checking of Boolean circuits
Viaarxiv icon

Who will stay? Using Deep Learning to predict engagement of citizen scientists

Add code
Apr 28, 2022
Figure 1 for Who will stay? Using Deep Learning to predict engagement of citizen scientists
Figure 2 for Who will stay? Using Deep Learning to predict engagement of citizen scientists
Figure 3 for Who will stay? Using Deep Learning to predict engagement of citizen scientists
Figure 4 for Who will stay? Using Deep Learning to predict engagement of citizen scientists
Viaarxiv icon

Multidimensional Assignment Problem for multipartite entity resolution

Add code
Dec 06, 2021
Figure 1 for Multidimensional Assignment Problem for multipartite entity resolution
Figure 2 for Multidimensional Assignment Problem for multipartite entity resolution
Figure 3 for Multidimensional Assignment Problem for multipartite entity resolution
Figure 4 for Multidimensional Assignment Problem for multipartite entity resolution
Viaarxiv icon

Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems

Add code
May 17, 2018
Figure 1 for Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems
Figure 2 for Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems
Figure 3 for Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems
Figure 4 for Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems
Viaarxiv icon

On Cryptographic Attacks Using Backdoors for SAT

Add code
Mar 13, 2018
Figure 1 for On Cryptographic Attacks Using Backdoors for SAT
Viaarxiv icon

Multimodal Clustering for Community Detection

Add code
Feb 27, 2017
Figure 1 for Multimodal Clustering for Community Detection
Figure 2 for Multimodal Clustering for Community Detection
Figure 3 for Multimodal Clustering for Community Detection
Figure 4 for Multimodal Clustering for Community Detection
Viaarxiv icon

Encoding Cryptographic Functions to SAT Using Transalg System

Add code
Jul 04, 2016
Figure 1 for Encoding Cryptographic Functions to SAT Using Transalg System
Figure 2 for Encoding Cryptographic Functions to SAT Using Transalg System
Figure 3 for Encoding Cryptographic Functions to SAT Using Transalg System
Figure 4 for Encoding Cryptographic Functions to SAT Using Transalg System
Viaarxiv icon

Transalg: a Tool for Translating Procedural Descriptions of Discrete Functions to SAT

Add code
Oct 29, 2015
Figure 1 for Transalg: a Tool for Translating Procedural Descriptions of Discrete Functions to SAT
Figure 2 for Transalg: a Tool for Translating Procedural Descriptions of Discrete Functions to SAT
Viaarxiv icon

Using Monte Carlo method for searching partitionings of hard variants of Boolean satisfiability problem

Add code
Jul 03, 2015
Figure 1 for Using Monte Carlo method for searching partitionings of hard variants of Boolean satisfiability problem
Figure 2 for Using Monte Carlo method for searching partitionings of hard variants of Boolean satisfiability problem
Figure 3 for Using Monte Carlo method for searching partitionings of hard variants of Boolean satisfiability problem
Figure 4 for Using Monte Carlo method for searching partitionings of hard variants of Boolean satisfiability problem
Viaarxiv icon