Skip to main content
Article thumbnail
Location of Repository

www.stacs-conf.org EFFICIENT ISOMORPHISM TESTING FOR A CLASS OF GROUP EXTENSIONS

By François Le Gall

Abstract

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. 1

Year: 2011
OAI identifier: oai:CiteSeerX.psu:10.1.1.190.4286
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://drops.dagstuhl.de/opus/... (external link)
  • www.stacs-conf.org (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.