Local equations describe unreasonably efficient stochastic algorithms in random K-SAT

DOI10.1073/PNAS.2510153122MaRDI QIDQ6844705zbMATH OpenFDO

Authors David Machado, Jonathan González-García, Roberto Mulet

Publication date 13 March 2026

Published in Proceedings of the National Academy of Sciences of the United States of America (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1073/PNAS.2510153122

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Computational aspects of satisfiability (68R07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation methods and heuristics in mathematical programming (90C59)

Cited in

(1)

• The maximum-average subtensor problem: equilibrium and out-of-equilibrium properties

This page was built for publication: Local equations describe unreasonably efficient stochastic algorithms in random K-SAT

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6844705)