BEARdocs

A Quick Algorithm for Identifying Conjugate Groups in GF(2)

DSpace/Manakin Repository

BEARdocs is currently undergoing a scheduled upgrade. We expect the upgrade to be completed no later than Monday, March 2nd, 2015. During this time you will be able to access existing documents, but will not be able to log in or submit new documents.

Show simple item record

dc.contributor.author Maurer, Peter M.
dc.identifier.uri http://hdl.handle.net/2104/5265
dc.description.abstract This report gives the details an algorithm for determining whether two matrix groups are conjugate to one another. Each group is designated by a pair of matrices that generate the group. The algorithm is able to determine whether the two generated groups are conjugate to one another without actually generating the groups. en
dc.subject Algorithms en
dc.subject GF(2) Matrices en
dc.subject Theoretical Computer Science en
dc.title A Quick Algorithm for Identifying Conjugate Groups in GF(2) en
dc.license GPL en


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search BEARdocs


Advanced Search

Browse

My Account

Statistics