Some remarks on the survey decimation algorithm for K-satisfiability

Simple item page
dc.creatorParisi, Giorgio
dc.date2003-01-16
dc.date.accessioned2026-07-07T03:19:21Z
dc.date.available2026-07-07T03:19:21Z
dc.descriptionIn this note we study the convergence of the survey decimation algorithm. An analytic formula for the reduction of the complexity during the decimation is derived. The limit of the converge of the algorithm are estimated in the random case: interesting phenomena appear near the boundary of convergence.
dc.identifierhttps://arxiv.org/abs/cs/0301015
dc.identifierhttp://arxiv.org/abs/cs/0301015
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/31428
dc.subjectComputational Complexity
dc.subjectDisordered Systems and Neural Networks
dc.subjectData Structures and Algorithms
dc.subjectG.3, G.2.1
dc.titleSome remarks on the survey decimation algorithm for K-satisfiability
dc.typetext

Files

Collections

arXiv