When satisfiability solving meets symbolic computation
When satisfiability solving meets symbolic computation Page 1 64 COMMUNICATIONS OF
THE ACM | JULY 2022 | VOL. 65 | NO. 7 review articles MATHEMATICIANS HAVE LONG …
THE ACM | JULY 2022 | VOL. 65 | NO. 7 review articles MATHEMATICIANS HAVE LONG …
A SAT solver and computer algebra attack on the minimum kochen-specker problem
Z Li, C Bright, V Ganesh - ar**_and_BOINC-Based_Cube-and-Conquer/links/61d5a335da5d105e551d7964/Searching-for-Orthogonal-Latin-Squares-via-Cells-Map**-and-BOINC-Based-Cube-and-Conquer.pdf" data-clk="hl=en&sa=T&oi=gga&ct=gga&cd=5&d=6990877301993759088&ei=JQiqZ_OiLvimieoP0PTZiAI" data-clk-atid="cOGt7d2VBGEJ" target="_blank">[PDF] researchgate.net
Searching for orthogonal Latin squares via cells map** and BOINC-based Cube-and-Conquer
This study focuses on searching for pairs of orthogonal diagonal Latin squares of order 10.
Consider a cells map** in accordance to which one diagonal Latin square is mapped to …
Consider a cells map** in accordance to which one diagonal Latin square is mapped to …
Inverting Step-Reduced SHA-1 and MD5 by Parameterized SAT Solvers
O Zaikin - 30th International Conference on Principles and …, 2024 - drops.dagstuhl.de
MD5 and SHA-1 are fundamental cryptographic hash functions proposed in 1990s. Given a
message of arbitrary finite size, MD5 produces a 128-bit hash in 64 steps, while SHA-1 …
message of arbitrary finite size, MD5 produces a 128-bit hash in 64 steps, while SHA-1 …
AlphaMapleSAT: An MCTS-based Cube-and-Conquer SAT Solver for Hard Combinatorial Problems
This paper introduces AlphaMapleSAT, a novel Monte Carlo Tree Search (MCTS) based
Cube-and-Conquer (CnC) SAT solving method aimed at efficiently solving challenging …
Cube-and-Conquer (CnC) SAT solving method aimed at efficiently solving challenging …
Formal Verification of the Empty Hexagon Number
B Subercaseaux, W Nawrocki, J Gallicchio… - arxiv preprint arxiv …, 2024 - arxiv.org
A recent breakthrough in computer-assisted mathematics showed that every set of $30 $
points in the plane in general position (ie, without three on a common line) contains an …
points in the plane in general position (ie, without three on a common line) contains an …
Improving Integer and Constraint Programming for Graeco-Latin Squares
N Rubin, C Bright, K Cheung… - 2021 IEEE 33rd …, 2021 - ieeexplore.ieee.org
We use integer programming (IP) and constraint programming (CP) to search for graeco-
latin squares. We improve the performance of the solvers by formulating an extended …
latin squares. We improve the performance of the solvers by formulating an extended …