The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem
From MaRDI portal
Publication:5459119
Recommendations
- Nondeterministics circuits, space complexity and quasigroups
- scientific article; zbMATH DE number 4165152
- On the \(n\log{n}\) isomorphism technique (preliminary report)
- The complexity of checking the polynomial completeness of finite quasigroups
- Graph isomorphism is not \(\mathrm{AC}^0\) reducible to group isomorphism
Cited in
(8)- The minimum generating set problem
- Random ubiquitous transformation semigroups
- Compact data structures for Dedekind groups and finite rings
- An algorithm for finding minimal generating sets of finite groups
- Computing generating sets of minimal size in finite algebras
- Nondeterministics circuits, space complexity and quasigroups
- scientific article; zbMATH DE number 2077108 (Why is no real title available?)
- Linear space data structures for finite groups with constant query-time
This page was built for publication: The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459119)