The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem

DOI10.1007/11940128_25zbMATH Open1135.68434OpenAlexW1573848150MaRDI QIDQ5459119FDOQ5459119

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

Recommendations

• Nondeterministics circuits, space complexity and quasigroups
• scientific article
• 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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

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
• Title not available (Why is that?)
• 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)