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 ...

go-sat is a pure Go library for solving Boolean satisfiability problems (SAT). Solving SAT problems is at the core of a number of more difficult higher level problems. From hardware/software ...

Feature-selective firing allows networks to produce representations of the external and internal environments. Despite its importance, the mechanisms generating neuronal feature selectivity are ...

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, ...