Author： Ostheimer G.
Publisher： Academic Press
ISSN： 0747-7171
Source： Journal of Symbolic Computation, Vol.28, Iss.3, 1999-09, pp. : 361-379
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Access to resources
Recommend
Efficient Collection in Infinite Polycyclic Groups
By Gebhardt V.
Journal of Symbolic Computation, Vol. 34, Iss. 3, 2002-09 ,pp. :
Orbit-stabilizer Problems and Computing Normalizers for Polycyclic Groups
By Eick B.
Journal of Symbolic Computation, Vol. 34, Iss. 1, 2002-07 ,pp. :
Some Algorithms for Nilpotent Permutation Groups
By Luks E.M. Rakoczi F. Wright C.R.B.
Journal of Symbolic Computation, Vol. 23, Iss. 4, 1997-04 ,pp. :
Parallel algorithms for certain matrix computations
By Codenotti B. Datta B.N. Datta K. Leoncini M.
Theoretical Computer Science, Vol. 180, Iss. 1, 1997-06 ,pp. :