隐藏随机约束满足问题的安静解
Hiding Quiet Solutions in Random Constraint Satisfaction Problems
摘要:
我们研究所谓的“种植”随机合奏约束满足问题。我们表明,对于某一类问题,如图着色,通常的随机系综的许多属性是定量相同的种植随机系综。我们研究了结构的相变,以及在平均计算复杂度下的易/难/易模式。我们还讨论了有限温度相图,发现与液体/玻璃/固体唯象的密切联系。
英文摘要:
We study constraint satisfaction problems on the so-called 'planted' random ensemble. We show that for a certain class of problems, e.g. graph coloring, many of the properties of the usual random ensemble are quantitatively identical in the planted random ensemble. We study the structural phase transitions, and the easy/hard/easy pattern in the average computational complexity. We also discuss the finite temperature phase diagram, finding a close connection with the liquid/glass/solid phenomenology.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。