Nov 12, 2020 Efficient solution of Boolean satisfiability problems with digital memcomputing Sean R. B. Bearden, Yan Ru Pei & Massimiliano Di Ventra Boolean satisfiability is a propositional logic problem of interest in multiple fields, e.g., physics, mathematics, and computer science. Beyond a field of research, instances of the SAT problem, as it is known,…
