On the constant-depth circuit complexity of generating quasigroups

DOI10.46298/THEORETICS.25.19MaRDI QIDQ6912582zbMATH OpenFDO

Authors Nathaniel A. Collins, Joshua A. Grochow, Michael Levet, Armin Weiß

Publication date 22 October 2025

Published in TheoretiCS (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

circuit complexitymembershipgroup isomorphismminimum generating set

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Loops, quasigroups (20N05) Networks and circuits as models of computation; circuit complexity (68Q06)

This page was built for publication: On the constant-depth circuit complexity of generating quasigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6912582)