Augmenting an electronic Ising machine to effectively solve boolean satisfiability.

ABSTRACT: With the slowdown of improvement in conventional von Neumann systems, increasing attention is paid to novel paradigms such as Ising machines. They have very different approach to solving combinatorial optimization problems. Ising machines have shown great potential in solving binary optimization problems like MaxCut. In this paper, we present an analysis of these systems in boolean satisfiability (SAT) problems. We demonstrate that, in the case of 3-SAT, a basic architecture fails to produce meaningful acceleration, largely due to the relentless progress made in conventional SAT solvers. Nevertheless, careful analysis attributes part of the failure to the lack of two important components: cubic interactions and efficient randomization heuristics. To overcome these limitations, we add prope

SUBMITTER: Sharma A 

PROVIDER: S-EPMC10739962 | biostudies-literature | 2023 Dec

REPOSITORIES: biostudies-literature