On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Grochow, Joshua A., Johnson, Dan, Levet, Michael
Format:	Preprint
Published:	2025
Subjects:	Computational Complexity Data Structures and Algorithms Logic in Computer Science Group Theory 20A15, 68Q19, 68Q25 F.2.2; G.2.2; F.1.3; F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2504.19777