Files in this item
New refiners for permutation group search
Item metadata
dc.contributor.author | Jefferson, Christopher | |
dc.contributor.author | Pfeiffer, Markus | |
dc.contributor.author | Waldecker, Rebecca | |
dc.date.accessioned | 2018-10-17T11:30:08Z | |
dc.date.available | 2018-10-17T11:30:08Z | |
dc.date.issued | 2019-05 | |
dc.identifier | 245468143 | |
dc.identifier | 52864027-63bf-4373-b4a1-7b794318a6ea | |
dc.identifier | 85040448413 | |
dc.identifier | 000453109800006 | |
dc.identifier.citation | 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 | en |
dc.identifier.issn | 0747-7171 | |
dc.identifier.other | ArXiv: http://arxiv.org/abs/1608.08489v1 | |
dc.identifier.other | ORCID: /0000-0002-9881-4429/work/47136374 | |
dc.identifier.other | ORCID: /0000-0003-2979-5989/work/60887562 | |
dc.identifier.uri | https://hdl.handle.net/10023/16254 | |
dc.description.abstract | 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. | |
dc.format.extent | 23 | |
dc.format.extent | 539654 | |
dc.language.iso | eng | |
dc.relation.ispartof | Journal of Symbolic Computation | en |
dc.subject | Backtrack search | en |
dc.subject | Refiners | en |
dc.subject | Permutation groups | en |
dc.subject | Algorithmic group theory | en |
dc.subject | Computational algebra | en |
dc.subject | Partition backtrack | en |
dc.subject | QA75 Electronic computers. Computer science | en |
dc.subject | QA Mathematics | en |
dc.subject | NDAS | en |
dc.subject.lcc | QA75 | en |
dc.subject.lcc | QA | en |
dc.title | New refiners for permutation group search | en |
dc.type | Journal article | en |
dc.contributor.sponsor | EPSRC | en |
dc.contributor.sponsor | European Commission | en |
dc.contributor.sponsor | EPSRC | en |
dc.contributor.institution | University of St Andrews. School of Computer Science | en |
dc.contributor.institution | University of St Andrews. Centre for Interdisciplinary Research in Computational Algebra | en |
dc.identifier.doi | https://doi.org/10.1016/j.jsc.2017.12.003 | |
dc.description.status | Peer reviewed | en |
dc.identifier.grantnumber | EP/M022641/1 | en |
dc.identifier.grantnumber | 676541 | en |
dc.identifier.grantnumber | EP/M003728/1 | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.