Loading...
Please wait, while we are loading the content...
Similar Documents
Efficient Isomorphism Testing for a Class of Group Extensions
| Content Provider | Hyper Articles en Ligne (HAL) |
|---|---|
| Author | Le Gall, François |
| Copyright Year | 2009 |
| 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. |
| Related Links | https://inria.hal.science/inria-00360243/file/52-le_gall.pdf |
| Conference Proceedings | 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009 |
| Language | English |
| Publisher | HAL CCSD IBFI Schloss Dagstuhl |
| Publisher Date | 2009-01-01 |
| Access Restriction | Open |
| Subject Keyword | polynomial-time algorithms group isomorphism black-box groups |
| Content Type | Text |
| Resource Type | Conference Proceedings |
| Subject | Mathematics Computer Science |
