Ontology highlight
ABSTRACT:
SUBMITTER: Molnar B
PROVIDER: S-EPMC6242876 | biostudies-other | 2018 Nov
REPOSITORIES: biostudies-other
Molnár Botond B Molnár Ferenc F Varga Melinda M Toroczkai Zoltán Z Ercsey-Ravasz Mária M
Nature communications 20181119 1
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 constraint ...[more]