An algorithm for solving the factorization problem in permutation groups
From MaRDI portal
Publication:1264436
DOI10.1006/jsco.1998.0202zbMath0909.20002OpenAlexW1972851637MaRDI QIDQ1264436
Publication date: 28 January 1999
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1998.0202
permutation groupsfactorizationsefficient algorithmsSchreier-Sims methodshort wordsstrong generating sets
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Short expressions of permutations as products and cryptanalysis of the algebraic eraser ⋮ Distance in cayley graphs on permutation groups generated by $k$ $m$-Cycles
Uses Software
This page was built for publication: An algorithm for solving the factorization problem in permutation groups