2018
DOI: 10.1038/s41467-018-07327-2
|View full text |Cite
|
Sign up to set email alerts
|

A continuous-time MaxSAT solver with high analog performance

Abstract: Many real-life optimization problems can be formulated in Boolean logic as MaxSAT, a class of problems where the task is finding Boolean assignments to variables satisfying the maximum number of logical constraints. Since MaxSAT is NP-hard, no algorithm is known to efficiently solve these problems. Here we present a continuous-time analog solver for MaxSAT and show that the scaling of the escape rate, an invariant of the solver’s dynamics, can predict the maximum number of satisfiable constraints, often well b… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
24
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
3
2

Relationship

0
10

Authors

Journals

citations
Cited by 38 publications
(24 citation statements)
references
References 59 publications
0
24
0
Order By: Relevance
“…At this point, we note that there are several other streams of work on physical optimization in the literature that we shall not be dealing with in this paper. These works include a variety of Lagrange-like continuous-time solvers (16,17), Memcomputing methods (18), Reservoir Computing (19,20), adiabatic solvers using Kerr nonlinear oscillators (21), and probabilistic bit logic (22). A brief discussion of adiabatic Kerr oscillator systems (21) is presented in SI Appendix, section 4.…”
Section: Significancementioning
confidence: 99%
“…At this point, we note that there are several other streams of work on physical optimization in the literature that we shall not be dealing with in this paper. These works include a variety of Lagrange-like continuous-time solvers (16,17), Memcomputing methods (18), Reservoir Computing (19,20), adiabatic solvers using Kerr nonlinear oscillators (21), and probabilistic bit logic (22). A brief discussion of adiabatic Kerr oscillator systems (21) is presented in SI Appendix, section 4.…”
Section: Significancementioning
confidence: 99%
“…Pure and mixed-mode analog accelerators have been developed for accelerating a broad range of applications, including neural networks, SAT solvers, and neuromorphic computations [4,11,19,26,28,32,37]. One prominent line of work focuses on analog accelerators that target dynamical systems [7,8,15,18,34,41,43,45,46].…”
Section: Related Workmentioning
confidence: 99%
“…In a series of seminal papers [32,33,58], the authors construct a dynamical systems approach to study satisfiability problems. They construct a dynamical system that computes the solutions of SAT instances.…”
Section: Overviewmentioning
confidence: 99%