On isomorphism testing of groups with normal Hall subgroups
From MaRDI portal
Publication:2637286
Recommendations
- On isomorphism testing of groups with normal Hall subgroups
- Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups
- Polynomial-time isomorphism test for groups with abelian Sylow towers.
- Polynomial-time isomorphism test of groups that are tame extensions (extended abstract)
- Beating the generator-enumeration bound for solvable-group isomorphism
Cites work
- A new algorithm for the computation of canonical forms of matrices over fields
- An O(n) algorithm for Abelian p-group isomorphism and an O(n n) algorithm for Abelian group isomorphism
- Computing the structure of a finite abelian group
- Computing the structure of finite algebras
- Decomposing \(p\)-groups via Jordan algebras.
- Efficient isomorphism testing for a class of group extensions
- Factoring Groups Efficiently
- Finding central decompositions of p-groups.
- Graph isomorphism is not \(\mathrm{AC}^0\) reducible to group isomorphism
- scientific article; zbMATH DE number 3552764 (Why is no real title available?)
- scientific article; zbMATH DE number 706263 (Why is no real title available?)
- scientific article; zbMATH DE number 2133330 (Why is no real title available?)
- scientific article; zbMATH DE number 1849958 (Why is no real title available?)
- scientific article; zbMATH DE number 2114353 (Why is no real title available?)
- scientific article; zbMATH DE number 6783478 (Why is no real title available?)
- scientific article; zbMATH DE number 3108440 (Why is no real title available?)
- Hypergraph isomorphism and structural equivalence of Boolean functions
- Is code equivalence easy to decide?
- Linear time algorithms for Abelian group isomorphism and related problems
- On the \(n\log{n}\) isomorphism technique (preliminary report)
- On the deterministic complexity of factoring polynomials over finite fields
- Polynomial-time isomorphism test for groups with abelian Sylow towers.
- Sylow Subgroups in Parallel
Cited in
(7)- Isomorphism testing for \(p\)-groups
- Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups
- On isomorphism testing of groups with normal Hall subgroups
- scientific article; zbMATH DE number 278890 (Why is no real title available?)
- Nearly linear time isomorphism algorithms for some nonabelian group classes
- Faster isomorphism for p-groups of class 2 and exponent p
- Linear space data structures for finite groups with constant query-time
This page was built for publication: On isomorphism testing of groups with normal Hall subgroups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2637286)
