arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1608.08489math.GRcs.DM
收藏

用于置换群搜索的新的加细器

New refiners for permutation group search

Christopher Jefferson, Markus Pfeiffer, Rebecca Waldecker

摘要:

我们描述了如何轨道图可以用来提高置换群,包括交叉和稳定器问题的许多算法的实际性能。首先,我们解释如何轨道图可以集成在分区回溯,目前最先进的算法,许多置换群问题。然后,我们展示了我们的算法在实践中的表现,演示了一些问题的几个数量级的改进。

英文摘要:

We describe how orbital graphs can be used to improve the practical performance of many algorithms for permutation groups, including intersection and stabilizer problems. First we explain how orbital graphs can be integrated in partition backtracking, the current state of the art algorithm for many permutation group problems. We then show how our algorithms perform in practice, demonstrating improvements of several orders of magnitude for some problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑