Directly encoding each 3-SAT clause as a three-body hyperedge lets a simulated p-bit solver reach the satisfying-assignment ground state with fewer nodes and higher success rates than conventional logic-synthesized Boltzmann machines.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
physics.comp-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Solving Boolean Satisfiability Problems Using A Hypergraph-based Probabilistic Computer
Directly encoding each 3-SAT clause as a three-body hyperedge lets a simulated p-bit solver reach the satisfying-assignment ground state with fewer nodes and higher success rates than conventional logic-synthesized Boltzmann machines.