2 papers
cs.DS2026
On the Parallel Complexity of Identifying Groups and Quasigroups via Decompositions
Dan Johnson, Michael Levet, Petr VojtÄchovský +2
In this paper, we investigate the computational complexity of isomorphism testing for finite groups and quasigroups, given by their multiplication tables. We crucially take advanta…
cs.CC2025
On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness
Joshua A. Grochow, Dan Johnson, Michael Levet
In this paper, we exhibit an isomorphism test for groups without Abelian normal subgroups (a.k.a. Fitting-free groups), a class for which isomorphism testing was…