3 citations · 3 across the 1 of their papers we have counts for
1 paper · 1 filter
Jing-Chao Chen
The DIMACS 32-bit parity problem is a satisfiability (SAT) problem hard to solve. So far, EqSatz by Li is the only solver which can solve this problem. However, This solver is very…