Abstract: Boolean satisfiability is seeing increasing use as a decision procedure in electronic design automation (EDA) and other domains. Most applications encode their domain specific constraints in ...
Abstract: The Boolean Satisfiability Problem (SAT) is a computationally challenging and fundamental problem in computer science, with extensive applications in cryptography, artificial intelligence, ...
We provide Ising formulations for many NP-complete and NP-hard problems, including all of Karp's 21 NP-complete problems. This collects and extends mappings to the Ising model from partitioning, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results