Efficient representation of perm groups

Simple item page
dc.creatorKnuth, Donald E.
dc.date1991-01-01
dc.date.accessioned2026-07-07T09:14:44Z
dc.date.available2026-07-07T09:14:44Z
dc.descriptionThis note presents an elementary version of Sims's algorithm for computing strong generators of a given perm group, together with a proof of correctness and some notes about appropriate low-level data structures. Upper and lower bounds on the running time are also obtained. (Following a suggestion of Vaughan Pratt, we adopt the convention that perm $=$ permutation, perhaps thereby saving millions of syllables in future research.)
dc.identifierhttps://arxiv.org/abs/math/9201304
dc.identifierhttp://arxiv.org/abs/math/9201304
dc.identifierCombinatorica 11 (1991), no. 1, 33--43
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/152783
dc.subjectGroup Theory
dc.titleEfficient representation of perm groups
dc.typetext

Files

Collections

arXiv