作为约束满足问题计算纽结不变量
Computing a Knot Invariant as a Constraint Satisfaction Problem
摘要：
指出了数学纽结理论与自旋玻璃/搜索问题之间的联系。特别是，我们提出了一个统计机械公式的问题，计算一个结不变的p-着色问题，它提供了一个算法来找到解决方案。该方法还可以让一个得到一些更深入的了解结构的复杂性的节点，这是预期的约束满足问题的景观结构。
英文摘要：
We point out the connection between mathematical knot theory and spin glass/search problem. In particular, we present a statistical mechanical formulation of the problem of computing a knot invariant; p-colorability problem, which provides an algorithm to find the solution. The method also allows one to get some deeper insight into the structural complexity of knots, which is expected to be related with the landscape structure of constraint satisfaction problem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
