Permutations of bounded degree generate groups of polynomial diameter

DOI10.1016/0020-0190(84)90062-0zbMath0569.68031OpenAlexW2036895204MaRDI QIDQ1060843

Pierre McKenzie

Publication date: 1984

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(84)90062-0

zbMATH Keywords

permutation group

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General theory for finite permutation groups (20B05)

Related Items

Computing short generator sequences, On the diameter of Cayley graphs of the symmetric group, On the diameter of permutation groups., Growth in SL2 over finite fields, On the diameter of permutation groups, Processor interconnection networks from Cayley graphs, Growth in groups: ideas and perspectives

Cites Work

• Unnamed Item
• The minimum-length generator sequence problem is NP-hard