The following pages link to (Q3950713):
Displaying 19 items.
- Algorithms for finitely \(L\)-presented groups and their applications to some self-similar groups. (Q392149) (← links)
- Verifying nilpotence (Q580975) (← links)
- Scalable parallel coset enumeration: bulk definition and the memory wall (Q697483) (← links)
- A computer program for the calculation of a covering group of a finite group (Q801032) (← links)
- Effective computation with group homomorphisms (Q1062134) (← links)
- Constructing matrix representations of finitely presented groups (Q1192225) (← links)
- The Knuth-Bendix procedure for strings as a substitute for coset enumeration (Q1192226) (← links)
- Syntactic and Rees indices of subsemigroups (Q1270378) (← links)
- Recognizing badly presented \(Z\)-modules (Q1311319) (← links)
- On vector enumeration (Q1311325) (← links)
- Automorphism group computation and isomorphism testing in finite groups (Q1401150) (← links)
- Constructing a short defining set of relations for a finite group (Q1593794) (← links)
- An algorithmic approach to fundamental groups and covers of combinatorial cell complexes (Q1971493) (← links)
- Obituary: Joachim Neubüser (1932--2021) (Q2165021) (← links)
- Computing maximal subgroups of finite groups. (Q2643528) (← links)
- Computing group resolutions. (Q2643554) (← links)
- Systolic length of triangular modular curves (Q2672017) (← links)
- A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model (Q3511316) (← links)
- Freeness and 𝑆-arithmeticity of rational Möbius groups (Q5886545) (← links)
