On black-box optimization in divide-and-conquer SAT solving
From MaRDI portal
Publication:5085259
DOI10.1080/10556788.2019.1685993zbMath1494.90051OpenAlexW2984833564MaRDI QIDQ5085259
S. E. Kochemazov, Oleg Sergeevich Zaikin
Publication date: 27 June 2022
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2019.1685993
cryptanalysisSATMonte-Carlo methoddivide-and-conquerblack-box optimizationpseudo-Boolean optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- SAT race 2015
- Application of optimization methods for finding equilibrium states of two-dimensional crystals
- New stream cipher designs. The eSTREAM finalists
- Efficient global optimization of expensive black-box functions
- On the analysis of the \((1+1)\) evolutionary algorithm
- ALIAS: a modular tool for finding backdoors for SAT
- Future paths for integer programming and links to artificial intelligence
- Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
- Black-box optimization in an extended search space for SAT solving
- PSATO: A distributed propositional prover and its application to quasigroup problems
- Parallel Logical Cryptanalysis of the Generator A5/1 in BNB-Grid System
- URSA: A System for Uniform Reduction to SAT
- Attacking Bivium Using SAT Solvers
- Algebraic Cryptanalysis
- `` Direct Search Solution of Numerical and Statistical Problems
- Derivative-Free and Blackbox Optimization
- Error Detecting and Error Correcting Codes
- Contradiction Immunity and Guess-Then-Determine Attacks on Gost
- Partitioning SAT Instances for Distributed Solving
- Tools and Algorithms for the Construction and Analysis of Systems
- Two Trivial Attacks on Trivium
- Branch-and-Bound Methods: A Survey
- A machine program for theorem-proving
- The complexity of theorem-proving procedures
- The Monte Carlo Method
- Handbook of metaheuristics
- Variable neighborhood search: Principles and applications
- Random forests
This page was built for publication: On black-box optimization in divide-and-conquer SAT solving
