1 paper
Christopher R. Serrano, Jonathan Gallagher, Kenji Yamada +2
The boolean satisfiability (SAT) problem asks whether there exists an assignment of boolean values to the variables of an arbitrary boolean formula making the formula evaluate to T…