Solving Hybrid Boolean Constraints by Fourier Expansions and Continuous Optimization

[Free GPT-4]
[PDF] sciencedirect.com

Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions

A Kyrillidis, A Shrivastava, MY Vardi, Z Zhang - Artificial Intelligence, 2021 - Elsevier
Abstract 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 …
Save Cite Cited by 3 Related articles All 4 versionsFree GPT-4