scientific article; zbMATH DE number 3303153
From MaRDI portal
Publication:5584596
Cited in
(13)- Automorphism group computation and isomorphism testing in finite groups
- Obituary: Joachim Neubüser (1932--2021)
- Algorithms based on \(*\)-algebras, and their applications to isomorphism of polynomials with one secret, group isomorphism, and polynomial identity testing
- Beating the generator-enumeration bound for \(p\)-group isomorphism
- Algorithms for group isomorphism via group extensions and cohomology
- Improved Algorithms for Alternating Matrix Space Isometry: From Theory to Practice
- On the Complexity of Isomorphism Problems for Tensors, Groups, and Polynomials I: Tensor Isomorphism-Completeness
- Faster isomorphism for p-groups of class 2 and exponent p
- Complexity of identifying fitting-free groups
- On the constant-depth circuit complexity of generating quasigroups
- On p-group isomorphism: search-to-decision, counting-to-decision and nilpotency class reductions via tensors
- On the complexity of isomorphism problems for tensors, groups, and polynomials. I: Tensor isomorphism-completeness
- Parallel complexity of identifying groups and quasigroups via decompositions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5584596)
