The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem

DOI10.1007/11940128_25MaRDI QIDQ5459119zbMATH OpenOpenAlexFDO

Authors Vikraman Arvind, Jacobo Torán

Publication date 24 April 2008

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11940128_25

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

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

(11)

• 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
• Constant depth circuit complexity for generating quasigroups
• 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?)
• The logics for the complexity classes with limited non-determinism
• On the constant-depth circuit complexity of generating quasigroups
• 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)