关于K-可满足性的测量抽取算法的几点注记
Some remarks on the survey decimation algorithm for K-satisfiability
摘要:
本文研究了测量抽取算法的收敛性。推导出减少抽取过程中的复杂度的解析公式。在随机情形下估计了算法的收敛极限:在收敛边界附近出现有趣的现象。
英文摘要:
In 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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。