AbstractA polynomial time isomorphism test for a class of groups, properly containing the class of abelian groups, given either by multiplication tables or by generators and relators, is described. It is also shown that graph isomorphism testing is uniformly reducible to a word problem of a finitely presented group
In this paper we obtain a new polynomial time algorithm for testing isomorphism of graphs. This algo...
The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case ...
A new method for computing the automorphism group of a finite permutation group and for testing two ...
A polynomial time isomorphism test for a class of groups, properly containing the class of abelian g...
AbstractA polynomial time isomorphism test for a class of groups, properly containing the class of a...
A polynomial-time isomorphism test for a class of groups, properly containing the class of Abelian g...
AbstractWe describe the theoretical and practical details of an algorithm which can be used to decid...
AbstractWe describe the theoretical and practical details of an algorithm which can be used to decid...
AbstractWe describe the theoretical and practical details of an algorithm which can be used to decid...
Motivated by the desire for better isomorphism tests for finite groups, we present a polynomial-time...
We consider the problem of testing isomorphism of groups of order n given by Cayley tables. The triv...
AbstractWe consider the problem of determining if two finite groups are isomorphic. The groups are a...
We consider the problem of determining if two finite groups are isomorphic. The groups are assumed t...
The isomorphism problem for groups given by their multiplication tables has long been known to be so...
AbstractWe consider the problem of determining if two finite groups are isomorphic. The groups are a...
In this paper we obtain a new polynomial time algorithm for testing isomorphism of graphs. This algo...
The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case ...
A new method for computing the automorphism group of a finite permutation group and for testing two ...
A polynomial time isomorphism test for a class of groups, properly containing the class of abelian g...
AbstractA polynomial time isomorphism test for a class of groups, properly containing the class of a...
A polynomial-time isomorphism test for a class of groups, properly containing the class of Abelian g...
AbstractWe describe the theoretical and practical details of an algorithm which can be used to decid...
AbstractWe describe the theoretical and practical details of an algorithm which can be used to decid...
AbstractWe describe the theoretical and practical details of an algorithm which can be used to decid...
Motivated by the desire for better isomorphism tests for finite groups, we present a polynomial-time...
We consider the problem of testing isomorphism of groups of order n given by Cayley tables. The triv...
AbstractWe consider the problem of determining if two finite groups are isomorphic. The groups are a...
We consider the problem of determining if two finite groups are isomorphic. The groups are assumed t...
The isomorphism problem for groups given by their multiplication tables has long been known to be so...
AbstractWe consider the problem of determining if two finite groups are isomorphic. The groups are a...
In this paper we obtain a new polynomial time algorithm for testing isomorphism of graphs. This algo...
The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case ...
A new method for computing the automorphism group of a finite permutation group and for testing two ...
DOI
Add to ORKG