×

Succinct representation of finite abelian groups. (English) Zbl 1356.68277

Dumas, Jean-Guillaume (ed.), Proceedings of the 2006 international symposium on symbolic and algebraic computation, ISSAC 06, Genova, Italy, July 9–12, 2006. New York, NY: ACM Press (ISBN 1-59593-276-3). 87-92 (2006).

MSC:

68W30 Symbolic computation and algebraic computation
20K01 Finite abelian groups
68P05 Data structures
Full Text: DOI

References:

[1] W. Bosma, J. Cannon, and C. Playoust. The magma algebra system i: the user language. J. Symb. Comput., 24(3-4):235-265, 1997. 10.1006/jsco.1996.0125 · Zbl 0898.68039
[2] J. Buchmann, M. J. Jacobson, Jr., and E. Teske. On some computational problems in finite abelian groups. Mathematics of Computation, 66(220):1663-1687, 1997. 10.1090/S0025-5718-97-00880-6 · Zbl 0894.11050
[3] J. Buchmann and A. Schmidt. Computing the structure of a finite abelian group. Mathematics of Computation, 74(252):2017-2026, 2005. · Zbl 1089.20032
[4] The GAP Group. GAP - Groups, Algorithms, and Programming, Version 4.4, 2005. (http://www.gap-system.org).
[5] A. H. Karp. Bit reversal on uniprocessors. SIAM Rev., 38(1):1-26, 1996. 10.1137/1038001 · Zbl 0851.65101
[6] E. Krätzel. Die maximale Ordnung der Anzahl der wesentlich verschiedenen abelschen Gruppen n-ter Ordnung. Quart. J. Math. Oxford Ser. (2), 21:273-275, 1970. · Zbl 0206.03402
[7] C. R. Leedham-Green and L. H. Soicher. Collection from the left and other strategies. J. Symb. Comput., 9(5/6):665-675, 1990. 10.1016/S0747-7171(08)80081-8 · Zbl 0726.20001
[8] J. I. Munro and V. Raman. Succinct representation of balanced parentheses, static trees and planar graphs. In IEEE Symposium on Foundations of Computer Science, pages 118-126, 1997.
[9] J. I. Munro, V. Raman, and S. S. Rao. Space efficient suffix trees. In Foundations of Software Technology and Theoretical Computer Science, pages 186-196, 1998.
[10] J. I. Munro and S. S. Rao. Succinct representations of functions. In ICALP, pages 1006-1015, 2004. · Zbl 1099.68603
[11] J. M. Pollard. Monte Carlo methods for index computation mod p. Mathematics of Computation, 32:918-924, 1978. · Zbl 0382.10001
[12] D. Robinson. A Course in the Theory of Groups. Number 80 in Graduate Texts in Mathematics. Springer-Verlag, 1996.
[13] D. Shanks. Class number, a theory of factorization, and genera. In Proceedings of Symposia in Pure Mathematics, volume 20, pages 415-440. American Mathematical Society, 1971. · Zbl 0223.12006
[14] E. Teske. A space efficient algorithm for group structure computation. Math. Comput., 67(224):1637-1663, 1998. 10.1090/S0025-5718-98-00968-5 · Zbl 0965.11050
[15] Charles C. Sims. Computation with Finitely Presented Groups. Cambridge University Press. Cambridge, 1994. · Zbl 0828.20001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.