The minimum-length generator sequence problem is NP-hard

DOI10.1016/0196-6774(81)90029-8MaRDI QIDQ3920644zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Shimon Even, Oded Goldreich

Publication date 1981

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(81)90029-8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Permutation groups (20B99)

Cited in

(30)

• The time complexity of permutation routing via matching, token swapping and a variant
• Vertex reconstruction in Cayley graphs
• Membership problems in finite groups
• The complexity of finding minimum-length generator sequences
• Growth in SL2 over finite fields
• Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings
• The time complexity of the token swapping problem and its parallel variants
• Applications of finite non-abelian simple groups to cryptography in the quantum era
• On Applications of the Cayley Graphs of some Finite Groups of Exponent Five
• Sorting permutations by block-interchanges
• Cyclic group blocking polyhedra
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• The optimal routing of augmented cubes
• Diameter bounds and recursive properties of Full-Flag Johnson graphs
• Edge-foreward index of star graphs and other Cayley graphs
• scientific article; zbMATH DE number 7310266 (Why is no real title available?)
• A resource-efficient algorithm for study the growth in finite two-generator groups of exponent 5
• Sorting by bounded block-moves
• An algebraic view of bacterial genome evolution
• Find routes on a doughnut
• Some problems on Cayley graphs
• Approximation algorithms for sorting permutations by extreme block-interchanges
• Discrete logarithms for finite groups
• Synchronizing words and monoid factorization, yielding a new parameterized complexity class?
• Cryptographic hash functions and expander graphs: the end of the story?
• Parameterized complexity of factorization problems
• Permutations of bounded degree generate groups of polynomial diameter
• Computing short generator sequences
• An algorithm for computation of the growth functions in finite two-generated groups of exponent 5
• A sharp diameter bound for unipotent groups of classical type over ℤ/pℤ

This page was built for publication: The minimum-length generator sequence problem is NP-hard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3920644)