127 citations · 203 across the 11 of their papers we have counts for
1 paper · 1 filter
Wenjie Zhang, Zeyu Sun, Qihao Zhu +4
The Boolean satisfiability problem (SAT) is a famous NP-complete problem in computer science. An effective way for solving a satisfiable SAT problem is the stochastic local search…