Nearly linear time isomorphism algorithms for some nonabelian group classes

Show simple item record

dc.contributor.author Das, Bireswar
dc.contributor.author Sharma, Shivdutt
dc.date.accessioned 2020-11-13T14:48:04Z
dc.date.available 2020-11-13T14:48:04Z
dc.date.issued 2020-10
dc.identifier.citation Das, Bireswar and Sharma, Shivdutt, "Nearly linear time isomorphism algorithms for some nonabelian group classes", Theory of Computing Systems, DOI: 10.1007/s00224-020-10010-z, Oct. 2020. en_US
dc.identifier.issn 1432-4350
dc.identifier.issn 1433-0490
dc.identifier.uri https://doi.org/10.1007/s00224-020-10010-z
dc.identifier.uri https://repository.iitgn.ac.in/handle/123456789/5855
dc.description.abstract The isomorphism problem for groups, when the groups are given by their Cayley tables is a well-studied problem. This problem has been studied for various restricted classes of groups. Kavitha gave a linear time isomorphism algorithm for abelian groups (JCSS 2007). Although there are isomorphism algorithms for certain nonabelian group classes represented by their Cayley tables, the complexities of those algorithms are usually super-linear. In this paper, we design linear and nearly linear time isomorphism algorithms for some nonabelian groups.
dc.description.statementofresponsibility by Bireswar Das and Shivdutt Sharma
dc.language.iso en_US en_US
dc.publisher Springer en_US
dc.subject Group Isomorphism Problem en_US
dc.subject Nearly Linear Time Algorithms en_US
dc.subject Hamiltonian Groups en_US
dc.subject Cayley Table en_US
dc.title Nearly linear time isomorphism algorithms for some nonabelian group classes en_US
dc.type Article en_US
dc.relation.journal Theory of Computing Systems


Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record

Search Digital Repository


Browse

My Account