论对称性破缺的复杂性
On the Complexity of Breaking Symmetry
摘要:
我们可以通过消除一个对称类中的解来破坏对称性,这些解在字典序中不是最不重要的。这通常被称为lex-leader方法。不幸的是,由于对称群可以很大,lexleader方法一般不容易处理。我们证明了除了通常的字典序之外,使用其他全序一般不会降低对称性破缺的计算复杂性。因此,打破对称性与其他排序,如格雷码排序或蛇-莱克斯排序是棘手的一般。
英文摘要:
We can break symmetry by eliminating solutions within a symmetry class that are not least in the lexicographical ordering. This is often referred to as the lex-leader method. Unfortunately, as symmetry groups can be large, the lexleader method is not tractable in general. We prove that using other total orderings besides the usual lexicographical ordering will not reduce the computational complexity of breaking symmetry in general. It follows that breaking symmetry with other orderings like the Gray code ordering or the Snake-Lex ordering is intractable in general.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。