Answers are grounded in this paper and cite their sources.
Theoretical physics analysis reveals a spin glass transition and ultrametric phase space in graph partitioning, suggesting deep thermodynamic parallels to computationally hard problems.
Recently developed techniques of the statistical mechanics of random systems are applied to the graph partitioning problem. The averaged cost function is calculated and agrees well with numerical results. The problem bears close resemblance to that of spin glasses. The authors find a spin glass transition in the system, and the low temperature phase space has an ultrametric structure. This sheds light on the nature of hard computation problems.
No takes yet. Share an insight, caveat, or question.
Fu et al. (1986) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: