The following pages link to (Q4230332):
Displaying 20 items.
- Efficient characteristic refinements for finite groups (Q346563) (← links)
- A practical model for computation with matrix groups. (Q480641) (← links)
- A fast isomorphism test for groups whose Lie algebra has genus 2 (Q502735) (← links)
- Computing intersections and normalizers in soluble groups (Q919456) (← links)
- Algorithms for matrix groups and the Tits alternative (Q1288201) (← links)
- Solvable black-box group problems are low for PP (Q1390854) (← links)
- Computing matrix group decompositions with respect to a normal subgroup (Q1815004) (← links)
- Constructing composition factors for a linear group in polynomial time (Q2193255) (← links)
- Isomorphism testing of groups of cube-free order (Q2282990) (← links)
- Linear groups and computation (Q2292421) (← links)
- An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups (Q2428678) (← links)
- Computing conjugacy classes of elements in matrix groups. (Q2438900) (← links)
- Computing polycyclic presentations for polycyclic rational matrix groups. (Q2456603) (← links)
- Algorithms for computing with nilpotent matrix groups over infinite domains. (Q2481472) (← links)
- Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas (Q3007625) (← links)
- Computational approaches to the theory of finite soluble groups (Q3774056) (← links)
- (Q4133821) (← links)
- (Q4273610) (← links)
- Computing double cosets in soluble groups (Q5928888) (← links)
- On homomorphic encryption using abelian groups: classical security analysis (Q6611632) (← links)
