2 citations · 2 across the 5 of their papers we have counts for
1 paper · 1 filter
Md Solimul Chowdhury, Martin Müller, Jia You
Boolean Satisfiability (SAT) is a well-known NP-complete problem. Despite this theoretical hardness, SAT solvers based on Conflict Driven Clause Learning (CDCL) can solve large SAT…