A backtracking survey propagation algorithm for K-satisfiability

Simple item page
dc.creatorParisi, Giorgio
dc.date2003-08-25
dc.date.accessioned2026-07-07T02:53:06Z
dc.date.available2026-07-07T02:53:06Z
dc.descriptionIn this paper we present a backtracking version of the survey propagation algorithm. We show that the introduction of the simplest form of backtracking greatly improves the ability of the original survey propagation algorithm in solving difficult random problems near the sat-unsat transition.
dc.description9 pages, two figures
dc.identifierhttps://arxiv.org/abs/cond-mat/0308510
dc.identifierhttp://arxiv.org/abs/cond-mat/0308510
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/22083
dc.subjectDisordered Systems and Neural Networks
dc.subjectStatistical Mechanics
dc.titleA backtracking survey propagation algorithm for K-satisfiability
dc.typetext

Files

Collections

arXiv