无回溯搜索的精确相变及其对贪心算法性能的影响
Exact phase transition of backtrack-free search with implications on the power of greedy algorithms
摘要：
回溯是求解约束满足问题的一种基本策略。一个可满足的CSP实例是无回溯的，如果在回溯搜索过程中可以找到一个解决方案而不会遇到任何死胡同，这意味着该实例很容易解决。我们证明了在一些随机CSP中，即在RB模型和RD模型中，无回溯搜索的精确相变。这是第一次可以在一些随机CSP上识别无回溯搜索的精确相变。我们的技术成果也有有趣的影响的权力，贪心算法，随机超图的宽度和随机CSP的精确可满足性阈值。
英文摘要：
Backtracking is a basic strategy to solve constraint satisfaction problems (CSPs). A satisfiable CSP instance is backtrack-free if a solution can be found without encountering any dead-end during a backtracking search, implying that the instance is easy to solve. We prove an exact phase transition of backtrack-free search in some random CSPs, namely in Model RB and in Model RD. This is the first time an exact phase transition of backtrack-free search can be identified on some random CSPs. Our technical results also have interesting implications on the power of greedy algorithms, on the width of random hypergraphs and on the exact satisfiability threshold of random CSPs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
