most citedOn Continuous Local BDD-Based Search for Hybrid SAT Solving

2 citations · 3 across the 2 of their papers we have counts for

collaborators
Showing cs.LOShow all

1 paper · 1 filter

cs.LO2019★ 1 cited

FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints

Anastasios Kyrillidis, Anshumali Shrivastava, Moshe Y. Vardi +1

The Boolean SATisfiability problem (SAT) is of central importance in computer science. Although SAT is known to be NP-complete, progress on the engineering side, especially that of…