A Reconfigurable lsing Machine for Boolean Satisfiability Problems Featuring Many-Body Spin Interactions.

Yuqi Su Tony Tae-Hyoung Kim Bongjin Kim

Published in: CICC (2023)

Keyphrases

satisfiability problem
conjunctive normal form
np complete
temporal logic
search algorithm
phase transition
davis putnam logemann loveland
stochastic local search
solving hard
sat problem
pspace complete
stochastic local search algorithms
sat instances
randomly generated
boolean functions
max sat
finite domain