The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem

DOI10.1007/11940128_25zbMath1135.68434OpenAlexW1573848150MaRDI QIDQ5459119

V. Arvind, Jacobo Toran

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)

Related Items (5)

Computing generating sets of minimal size in finite algebras ⋮ The minimum generating set problem ⋮ Compact data structures for Dedekind groups and finite rings ⋮ An algorithm for finding minimal generating sets of finite groups ⋮ Random ubiquitous transformation semigroups

This page was built for publication: The Complexity of Quasigroup Isomorphism and the Minimum Generating Set Problem