<html><head><title>ANUPQ : a GAP 4 package - References</title></head> <body text="#000000" bgcolor="#ffffff"> <h1><font face="Gill Sans,Helvetica,Arial">ANUPQ</font> : a <font face="Gill Sans,Helvetica,Arial">GAP</font> 4 package - References</h1><dl> <dt><a name="HN80"><b>[HN80]</b></a><dd> George Havas and M[ichael] F. Newman. <br> Application of computers to questions like those of Burnside. <br> In J[ens] L. Mennicke, editor, <em>Burnside groups, Proceedings of a workshop, Bielefeld, Germany, 1977</em>, volume 806 of <em>Lecture Notes in Math.</em>, pages 211--230. Springer, Berlin, Heidelberg and New York, 1980. <dt><a name="LGS90"><b>[LGS90]</b></a><dd> C. R. Leedham-Green and L. H. Soicher. <br> Collection from the left and other strategies. <br> <em>J. Symbolic Comput.</em>, 9(5-6):665--675, 1990. <br> Computational group theory, Part 1. <dt><a name="New77"><b>[New77]</b></a><dd> M[ichael] F. Newman. <br> Determination of groups of prime-power order. <br> In R. A. Bryce, J. Cossey, and M[ichael] F. Newman, editors, <em> Group theory, Proc. Miniconf., Austral. Nat. Univ., Canberra, 1975</em>, volume 573 of <em>Lecture Notes in Math.</em>, pages 73--84. Springer, Berlin, Heidelberg and New York, 1977. <dt><a name="NNN98"><b>[NNN98]</b></a><dd> M. F. Newman, Werner Nickel, and Alice C. Niemeyer. <br> Descriptions of groups of prime-power order. <br> <em>J. Symbolic Comput.</em>, 25(5):665--682, 1998. <dt><a name="NO96"><b>[NO96]</b></a><dd> M[ichael] F. Newman and E[amonn] A. O'Brien. <br> Application of computers to questions like those of Burnside, II. <br> <em>Internat. J. Algebra Comput.</em>, 6:593--605, 1996. <dt><a name="OBr90"><b>[OBr90]</b></a><dd> E[amonn] A. O'Brien. <br> The <i>p</i>-group generation algorithm. <br> <em>J. Symbolic Comput.</em>, 9:677--698, 1990. <dt><a name="OBr94"><b>[OBr94]</b></a><dd> E[amonn] A. O'Brien. <br> Isomorphism testing for <i>p</i>-groups. <br> <em>J. Symbolic Comput.</em>, 17 (1):133--147, 1994. <dt><a name="OBr95"><b>[OBr95]</b></a><dd> E[amonn] A. O'Brien. <br> Computing automorphism groups of <i>p</i>-groups. <br> In Wieb Bosma and Alf van der Poorten, editors, <em>Computational Algebra Number and Number Theory</em>, pages 83--90. (Sydney, 1992), Kluwer Academic Publishers, Dordrecht, 1995. <dt><a name="Sims94"><b>[Sims94]</b></a><dd> C. C. Sims. <br> <em>Computation with Finitely Presented Groups</em>. <br> Cambridge University Press, 1994. <dt><a name="VL84"><b>[VL84]</b></a><dd> M[ichael] R. Vaughan-Lee. <br> An aspect of the Nilpotent Quotient Algorithm. <br> In Michael D. Atkinson, editor, <em>Computational Group Theory, Proceedings LMS Symposium on Computational Group Theory, Durham 1982</em>, pages 75--84. Academic Press, 1984. <dt><a name="VL90a"><b>[VL90a]</b></a><dd> M[ichael] R. Vaughan-Lee. <br> Collection from the left. <br> <em>J. Symbolic Comput.</em>, 9:725--733, 1990. <dt><a name="VL90b"><b>[VL90b]</b></a><dd> M[ichael] R. Vaughan-Lee. <br> <em>The restricted Burnside problem</em>, volume 5 of <em>London Math. Soc. Monographs</em>. <br> Oxford University Press, 1990. </dl><p> [<a href="chapters.htm">Up</a>]<p> <P> <address>ANUPQ manual<br>Januar 2006 </address></body></html>
distrib
>
Mandriva
>
2010.0
>
i586
>
media
>
contrib-release
>
by-pkgid
>
91213ddcfbe7f54821d42c2d9e091326
>
files
>
442
