Pages that link to "Item:Q1180408"

The following pages link to Efficient representation of perm groups (Q1180408):

Displaying 17 items.

• Succinct representations of permutations and functions (Q441860) (← links)
• Complexity classes of equivalence problems revisited (Q716333) (← links)
• Computing the order of a solvable permutation group (Q913945) (← links)
• A strong generating test and short presentations for permutation groups (Q1192229) (← links)
• An algorithm for solving the factorization problem in permutation groups (Q1264436) (← links)
• The use of permutation representations in structural computations in large finite matrix groups (Q2000260) (← links)
• Faster tensor canonicalization (Q2102478) (← links)
• Effective Invariant Theory of Permutation Groups Using Representation Theory (Q2947147) (← links)
• Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas (Q3007625) (← links)
• Generation of Colourings and Distinguishing Colourings of Graphs (Q3449807) (← links)
• A compact representation for permutation groups (Q3731029) (← links)
• Almost simple<i>p</i>-obstructions in odd characteristic lie type groups^∗ (Q4288264) (← links)
• (Q4538872) (← links)
• Orbit Computation for Atomically Generated Subgroups of Isometries of $\mathbb{Z}^n$ (Q4959127) (← links)
• Polynomial-time equivalence testing for deterministic fresh-register automata (Q5005176) (← links)
• A method for building permutation representations of finitely presented groups (Q5138285) (← links)
• Applications of finite non-abelian simple groups to cryptography in the quantum era (Q6564014) (← links)