A new method for computing the automorphism group of a finite permutation group and for testing two such groups for isomorphism is described. Some performance statistics are included for an implementation of these algorithms in the Magma language. (C) 2003 Elsevier Science Ltd. All rights reserved
AbstractA polynomial time isomorphism test for a class of groups, properly containing the class of a...
AbstractWe consider the problem of determining if two finite groups are isomorphic. The groups are a...
AbstractWe present a new deterministic algorithm to test constructively for isomorphism between two ...
AbstractA new method for computing the automorphism group of a finite permutation group and for test...
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...
A new method for computing the automorphism group Aut(G) of a reasonably small finite group G will b...
Motivated by the desire for better isomorphism tests for finite groups, we present a polynomial-time...
Abstract. In this paper we present an algorithm, called conauto-2.0, that can efficiently compute a ...
In this paper we combine many of the standard and more recent algebraic techniques for testing isomo...
We outline a new method for computing automorphism groups and performing isomorphism testing for sol...
AbstractA polynomial time isomorphism test for a class of groups, properly containing the class of a...
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN034651 / BLDSC - British Library D...
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...
AbstractWe consider the problem of determining if two finite groups are isomorphic. The groups are a...
AbstractWe present a new deterministic algorithm to test constructively for isomorphism between two ...
AbstractA new method for computing the automorphism group of a finite permutation group and for test...
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...
A new method for computing the automorphism group Aut(G) of a reasonably small finite group G will b...
Motivated by the desire for better isomorphism tests for finite groups, we present a polynomial-time...
Abstract. In this paper we present an algorithm, called conauto-2.0, that can efficiently compute a ...
In this paper we combine many of the standard and more recent algebraic techniques for testing isomo...
We outline a new method for computing automorphism groups and performing isomorphism testing for sol...
AbstractA polynomial time isomorphism test for a class of groups, properly containing the class of a...
SIGLEAvailable from British Library Document Supply Centre-DSC:DXN034651 / BLDSC - British Library D...
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...
AbstractWe consider the problem of determining if two finite groups are isomorphic. The groups are a...
AbstractWe present a new deterministic algorithm to test constructively for isomorphism between two ...
DOI
Add to ORKG