Sign in

BOSPHORUS: Bridging ANF and CNF Solvers

By Davin Choo and others
Algebraic Normal Form (ANF) and Conjunctive Normal Form (CNF) are commonly used to encode problems in Boolean algebra. ANFs are typically solved via Gr"obner basis algorithms, often using more memory than is feasible; while CNFs are solved using SAT solvers, which cannot exploit the algebra of polynomials naturally. We propose... Show more
December 11, 2018
=
0
Loading PDF…
Loading full text...
Similar articles
Loading recommendations...
=
0
x1
BOSPHORUS: Bridging ANF and CNF Solvers
Click on play to start listening