Black-box optimization in an extended search space for SAT solving

DOI10.1007/978-3-030-22629-9_28zbMath1444.90079OpenAlexW2950327759MaRDI QIDQ2181777

Stepan Kochemazov, Oleg Sergeevich Zaikin

Publication date: 19 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-22629-9_28

zbMATH Keywords

Monte Carlo methodcryptanalysisdiscrete optimizationSATblack-box optimization

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)

Related Items

On black-box optimization in divide-and-conquer SAT solving ⋮ Finding Effective SAT Partitionings Via Black-Box Optimization ⋮ On some variants of the merging variables based \((1+1)\)-evolutionary algorithm with application to MaxSAT problem

Uses Software

• ManySAT
• SpySMAC
• PaInleSS
• ALIAS