AbstractThe Todd-Coxeter coset enumeration method is without any doubt the best known and most used method in computational group theory. Surprisingly, however, it seems that no attempt has yet been made at producing a parallel version of it. This paper reports on such a parallel formulation
Todd and Coxeter's method for enumerating cosets of finitely generated subgroups in finitely present...
We develop further the linear Todd-Coxeter algorithm described previously. In particular, by slightl...
AbstractWe develop further the linear Todd-Coxeter algorithm described previously. In particular, by...
AbstractThe Todd-Coxeter coset enumeration method is without any doubt the best known and most used ...
One of the main algorithms of computational group theory is the Todd-Coxeter coset enumeration algor...
AbstractCoset enumeration is the principal method for solving the word problem in finitely presented...
AbstractWe develop further the linear Todd-Coxeter algorithm described previously. In particular, by...
Coset enumeration is a most important procedure for investigating finitely presented groups. We pres...
Coset enumeration, based on the methods described by Todd and Coxeter, is one of the basic tools for...
AbstractThe Todd-Coxeter coset enumeration algorithm is one of the most important tools of computati...
This thesis presents and evaluates a new parallel algorithm that computes all single cosets in the d...
This thesis presents and evaluates a new parallel algorithm that computes all single cosets in the d...
This thesis presents and evaluates a new parallel algorithm that computes all single cosets in the d...
Let P be the inverse monoid presentation (X|U) for the inverse monoid M, let π be the set of generat...
A double-coset enumeration algorithm for groups generated by symmetric sets of invo-lutions together...
Todd and Coxeter's method for enumerating cosets of finitely generated subgroups in finitely present...
We develop further the linear Todd-Coxeter algorithm described previously. In particular, by slightl...
AbstractWe develop further the linear Todd-Coxeter algorithm described previously. In particular, by...
AbstractThe Todd-Coxeter coset enumeration method is without any doubt the best known and most used ...
One of the main algorithms of computational group theory is the Todd-Coxeter coset enumeration algor...
AbstractCoset enumeration is the principal method for solving the word problem in finitely presented...
AbstractWe develop further the linear Todd-Coxeter algorithm described previously. In particular, by...
Coset enumeration is a most important procedure for investigating finitely presented groups. We pres...
Coset enumeration, based on the methods described by Todd and Coxeter, is one of the basic tools for...
AbstractThe Todd-Coxeter coset enumeration algorithm is one of the most important tools of computati...
This thesis presents and evaluates a new parallel algorithm that computes all single cosets in the d...
This thesis presents and evaluates a new parallel algorithm that computes all single cosets in the d...
This thesis presents and evaluates a new parallel algorithm that computes all single cosets in the d...
Let P be the inverse monoid presentation (X|U) for the inverse monoid M, let π be the set of generat...
A double-coset enumeration algorithm for groups generated by symmetric sets of invo-lutions together...
Todd and Coxeter's method for enumerating cosets of finitely generated subgroups in finitely present...
We develop further the linear Todd-Coxeter algorithm described previously. In particular, by slightl...
AbstractWe develop further the linear Todd-Coxeter algorithm described previously. In particular, by...
DOI
Add to ORKG