We propose ImitSAT, a branching policy for conflict-driven clause learning (CDCL) solvers based on imitation learning for the Boolean satisfiability problem (SAT). Unlike previous methods that predict ...
Abstract: Differential analysis for block ciphers based on automated solving tools such as mixed-integer linear programming (MILP) and Boolean satisfiability problem (SAT), has become one of the key ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results