Group Isomorphism: Depth- Circuits and Lower BoundsResearch Paper
Group Isomorphism (GpI) asks whether two finite groups, each given by its full multiplication table (its Cayley table), are isomorphic. With , Miller's generator-enumeration algorithm decides it in time , because every group of order is generated by at most elements. Whether GpI is in polynomial time is open, and so is the…