1 paper
Shang-Wei Lin, Tzu-Fan Wang, Yean-Ru Chen +3
Boolean satisfiability (SAT) solving is a fundamental problem in computer science. Finding efficient algorithms for SAT solving has broad implications in many areas of computer sci…