Reproduce “Efficient Solution of Boolean Satisfiability Problems with Digital MemComputing” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
S.R.B. Bearden, Y.R. Pei, M. Di Ventra
The authors use a dynamical system with memory to solve 3-SAT, representing variables as continuous voltages and coordinating their search. On CDC planted-solution instances at αr=4.3 and p0=0.08, simulated median integration steps scale as N^(3.0±0.1), while WalkSAT and SID show exponential scaling. This result is limited to tested benchmark simulations, not general SAT instances or hardware performance.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.