Computing in quotient groups
- 1 January 1990
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 524-534
- https://doi.org/10.1145/100216.100290
Abstract
We present polynomial-time algorithms for computation in quotient groupsG=K of a permutation group G. In effect, these solve, for quotient groups,the problems that are known to be in polynomial-time for permutation groups.Since it is not computationally feasible to represent G=K itself as a permutationgroup, the methodology for the quotient-group versions of such problemsfrequently differ markedly from the procedures that have been observed for theK = 1 subcases. Whereas the algorithms...Keywords
This publication has 0 references indexed in Scilit: