2 papers
cond-mat.dis-nn2025
Beyond-mean-field fluctuations for the solution of constraint satisfaction problems
Niklas Foos, Bastian Epping, Jannik Grundler +5
Constraint Satisfaction Problems (CSPs) lie at the heart of complexity theory and find application in a plethora of prominent tasks ranging from cryptography to genetics. Classical…
cond-mat.dis-nn2025
Reduction of interaction order in hard combinatorial optimization via conditionally independent degrees of freedom
Alexandru Ciobanu, David Dahmen, John Paul Strachan +1
Combinatorial optimization problems have a broad range of applications and map to physical systems with complex dynamics. Among them, the 3-SAT problem is prominent due to its NP-c…