Skip to Main content Skip to Navigation
Conference papers

Efficient Isomorphism Testing for a Class of Group Extensions

Abstract : The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism testing for nonabelian groups. In this paper we study this problem for a class of groups corresponding to one of the simplest ways of constructing nonabelian groups from abelian groups: the groups that are extensions of an abelian group A by a cyclic group Zm. We present an efficient algorithm solving the group isomorphism problem for all the groups of this class such that the order of A is coprime with m. More precisely, our algorithm runs in time almost linear in the orders of the input groups and works in the general setting where the groups are given as black-boxes.
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/inria-00360243
Contributor : Publications Loria <>
Submitted on : Tuesday, February 10, 2009 - 5:01:18 PM
Last modification on : Wednesday, November 29, 2017 - 10:27:37 AM
Long-term archiving on: : Tuesday, June 8, 2010 - 8:39:13 PM

File

52-le_gall.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00360243, version 1

Collections

Citation

François Le Gall. Efficient Isomorphism Testing for a Class of Group Extensions. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.625-636. ⟨inria-00360243⟩

Share

Metrics

Record views

89

Files downloads

250