collaborators

1 paper

cs.LO2026

GaloisSAT: Differentiable Boolean Satisfiability Solving via Finite Field Algebra

Curie Kim, Carsten Portner, Mingju Liu +6

Boolean satisfiability (SAT) problem, the first problem proven to be NP-complete, has become a fundamental challenge in computational complexity, with widespread applications in op…