超越 Lex-Leader 的对称性破缺复杂性
The Complexity of Symmetry Breaking Beyond Lex-Leader
AI总结:
本文研究 SAT 中完备对称性破缺谓词的计算复杂性,证明其受图非同构高效认证障碍限制,并给出树自同构群等情形的多项式上界。
摘要:
对称性破缺是约束规划中增强求解器(如 SAT 或 MIP 求解器)的一种广泛流行的方法。对称性破缺谓词(SBP)通常对变量施加一个顺序,并在每个赋值轨道中选出字典序领导者(lex-leader)。尽管寻找完备的 lex-leader SBP 是 NP 难的,但不完备的 lex-leader SBP 在实践中被广泛使用。本文研究了为 SAT 计算完备 SBP(无论是 lex-leader 还是其他形式)的复杂性。我们的主要结果证明了一个高效计算 SBP 的自然障碍:图非同构的高效认证。我们的结果解释了为重要 CP 问题获取短 SBP 的困难,例如具有行列对称性的矩阵模型和图生成问题。即使允许 SBP 引入额外变量,我们的结果仍然成立。我们展示了打破某些对称群的多项式上界,即树的自动同构群和具有高效 SBP 的群的圈积。
英文摘要:
Symmetry breaking is a widely popular approach to enhance solvers in constraint programming, such as those for SAT or MIP. Symmetry breaking predicates (SBPs) typically impose an order on variables and single out the lexicographic leader (lex-leader) in each orbit of assignments. Although it is NP-hard to find complete lex-leader SBPs, incomplete lex-leader SBPs are widely used in practice. In this paper, we investigate the complexity of computing complete SBPs, lex-leader or otherwise, for SAT. Our main result proves a natural barrier for efficiently computing SBPs: efficient certification of graph non-isomorphism. Our results explain the difficulty of obtaining short SBPs for important CP problems, such as matrix-models with row-column symmetries and graph generation problems. Our results hold even when SBPs are allowed to introduce additional variables. We show polynomial upper bounds for breaking certain symmetry groups, namely automorphism groups of trees and wreath products of groups with efficient SBPs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。