Pages that link to "Item:Q3920644"

The following pages link to The minimum-length generator sequence problem is NP-hard (Q3920644):

Displaying 27 items.

• An algebraic view of bacterial genome evolution (Q476821) (← links)
• Sorting permutations by block-interchanges (Q673336) (← links)
• Some problems on Cayley graphs (Q952069) (← links)
• Vertex reconstruction in Cayley graphs (Q1011492) (← links)
• The complexity of finding minimum-length generator sequences (Q1058290) (← links)
• Permutations of bounded degree generate groups of polynomial diameter (Q1060843) (← links)
• Computing short generator sequences (Q1090414) (← links)
• Sorting by bounded block-moves (Q1281770) (← links)
• Edge-foreward index of star graphs and other Cayley graphs (Q1382271) (← links)
• The optimal routing of augmented cubes (Q1751422) (← links)
• Diameter bounds and recursive properties of Full-Flag Johnson graphs (Q1752664) (← links)
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement (Q1902472) (← links)
• Cyclic group blocking polyhedra (Q1949270) (← links)
• Approximation algorithms for sorting permutations by extreme block-interchanges (Q2235751) (← links)
• Discrete logarithms for finite groups (Q2390938) (← links)
• Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings (Q2482209) (← links)
• Cryptographic Hash Functions and Expander Graphs: The End of the Story? (Q2803636) (← links)
• The Time Complexity of the Token Swapping Problem and Its Parallel Variants (Q2980932) (← links)
• Growth in SL2 over finite fields (Q3007962) (← links)
• A sharp diameter bound for unipotent groups of classical type over ℤ/pℤ (Q3550695) (← links)
• The Time Complexity of Permutation Routing via Matching, Token Swapping and a Variant (Q4622770) (← links)
• Synchronizing words and monoid factorization, yielding a new parameterized complexity class? (Q5048011) (← links)
• (Q5150649) (← links)
• AN ALGORITHM FOR COMPUTATION OF THE GROWTH FUNCTIONS IN FINITE TWO-GENERATED GROUPS OF EXPONENT 5 (Q5150752) (← links)
• A resource-efficient algorithm for study the growth in finite two-generator groups of exponent 5 (Q5151247) (← links)
• On Applications of the Cayley Graphs of some Finite Groups of Exponent Five (Q5853207) (← links)
• Applications of finite non-abelian simple groups to cryptography in the quantum era (Q6564014) (← links)