Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Babai, L.: Randomization in group algorithms: conceptual questions. In: Finklelstein, L., Kantor, W.M. (eds.) Groups and Computation. II, vol. 28, pp. 1–17 (1997)
2. Buchman, J., Jacobson Jr., M.J., Teske, E.: On some computational problems in finite abelian groups. Mathematics of Computation 66, 1663–1687 (1997)
3. Buchmann, J., Schmidt, A.: Computing the structure of a finite abelian group. Mathematics of Computation 74, 2017–2026 (2005)
4. Chen, L.: Algorithms and their complexity analysis for some problems in finite group. Journal of Sandong Normal University 2, 27–33 (1984) (in Chinese)
5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)