New refiners for permutation group search
MetadataShow full item record
Partition backtrack is the current generic state of the art algorithm to search for subgroups of a given permutation group. We describe an improvement of partition backtrack for set stabilizers and intersections of subgroups by using orbital graphs. With extensive experiments we demonstrate that our methods improve performance of partition backtrack – in some cases by several orders of magnitude.
Jefferson , C , Pfeiffer , M & Waldecker , R 2019 , ' New refiners for permutation group search ' Journal of Symbolic Computation , vol. 92 , pp. 70-92 . https://doi.org/10.1016/j.jsc.2017.12.003
Journal of Symbolic Computation
©2018 The Authors. Published by Elsevier Ltd. This is an open access article under the CC-BY license (http://creativecommons.org/licenses/by/4.0/).Copyright © 2018 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.