| 1 |
<?xml version="1.0" encoding="UTF-8"?> |
| 2 |
|
| 3 |
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" |
| 4 |
"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd"> |
| 5 |
|
| 6 |
<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en"> |
| 7 |
<head> |
| 8 |
<title>GAP (ANUPQ) - References</title> |
| 9 |
<meta http-equiv="content-type" content="text/html; charset=UTF-8" /> |
| 10 |
<meta name="generator" content="GAPDoc2HTML" /> |
| 11 |
<link rel="stylesheet" type="text/css" href="manual.css" /> |
| 12 |
<script src="manual.js" type="text/javascript"></script> |
| 13 |
<script type="text/javascript">overwriteStyle();</script> |
| 14 |
</head> |
| 15 |
<body class="chapBib" onload="jscontent()"> |
| 16 |
|
| 17 |
|
| 18 |
<div class="chlinktop"><span class="chlink1">Goto Chapter: </span><a href="chap0.html">Top</a> <a href="chap1.html">1</a> <a href="chap2.html">2</a> <a href="chap3.html">3</a> <a href="chap4.html">4</a> <a href="chap5.html">5</a> <a href="chap6.html">6</a> <a href="chap7.html">7</a> <a href="chapA.html">A</a> <a href="chapBib.html">Bib</a> <a href="chapInd.html">Ind</a> </div> |
| 19 |
|
| 20 |
<div class="chlinkprevnexttop"> <a href="chap0.html">[Top of Book]</a> <a href="chap0.html#contents">[Contents]</a> <a href="chapA.html">[Previous Chapter]</a> <a href="chapInd.html">[Next Chapter]</a> </div> |
| 21 |
|
| 22 |
<p id="mathjaxlink" class="pcenter"><a href="chapBib_mj.html">[MathJax on]</a></p> |
| 23 |
<p><a id="X7A6F98FD85F02BFE" name="X7A6F98FD85F02BFE"></a></p> |
| 24 |
|
| 25 |
<h3>References</h3> |
| 26 |
|
| 27 |
|
| 28 |
<p><a id="biBHN80" name="biBHN80"></a></p> |
| 29 |
<p class='BibEntry'> |
| 30 |
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=586047">HN80</a></span>] <b class='BibAuthor'>Havas, G. and Newman, M. F.</b>, |
| 31 |
<a href="https://doi.org/10.1007/BFb0091271"><i class='BibTitle'>Application of computers to questions like those of |
| 32 |
Burnside</i></a>, |
| 33 |
in <i class='BibBooktitle'>Burnside groups (Proc. Workshop, Univ. |
| 34 |
Bielefeld, |
| 35 |
Bielefeld, 1977)</i>, |
| 36 |
<span class='BibPublisher'>Springer</span>, |
| 37 |
<span class='BibSeries'>Lecture Notes in Math.</span>, |
| 38 |
<em class='BibVolume'>806</em>, |
| 39 |
<span class='BibAddress'>Berlin</span> |
| 40 |
(<span class='BibYear'>1980</span>), |
| 41 |
<span class='BibPages'>211--230</span>. |
| 42 |
</p> |
| 43 |
|
| 44 |
|
| 45 |
<p><a id="biBLGS90" name="biBLGS90"></a></p> |
| 46 |
<p class='BibEntry'> |
| 47 |
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1075430">LS90</a></span>] <b class='BibAuthor'>Leedham-Green, C. R. and Soicher, L. H.</b>, |
| 48 |
<a href="https://doi.org/10.1016/S0747-7171(08)80081-8"><i class='BibTitle'>Collection from the left and other strategies</i></a>, |
| 49 |
<span class='BibJournal'>J. Symbolic Comput.</span>, |
| 50 |
<em class='BibVolume'>9</em> (<span class='BibNumber'>5-6</span>) |
| 51 |
(<span class='BibYear'>1990</span>), |
| 52 |
<span class='BibPages'>665--675</span><br /> |
| 53 |
(<span class='BibNote'>Computational group theory, Part 1</span>). |
| 54 |
</p> |
| 55 |
|
| 56 |
|
| 57 |
<p><a id="biBNew77" name="biBNew77"></a></p> |
| 58 |
<p class='BibEntry'> |
| 59 |
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=0453862">New77</a></span>] <b class='BibAuthor'>Newman, M. F.</b>, |
| 60 |
<i class='BibTitle'>Determination of groups of prime-power order</i>, |
| 61 |
in <i class='BibBooktitle'>Group theory (Proc. Miniconf., Australian |
| 62 |
Nat. |
| 63 |
Univ., Canberra, 1975)</i>, |
| 64 |
<span class='BibPublisher'>Springer</span>, |
| 65 |
<span class='BibAddress'>Berlin</span> |
| 66 |
(<span class='BibYear'>1977</span>), |
| 67 |
<span class='BibPages'>73--84. Lecture Notes in Math., Vol. 573</span>. |
| 68 |
</p> |
| 69 |
|
| 70 |
|
| 71 |
<p><a id="biBNNN98" name="biBNNN98"></a></p> |
| 72 |
<p class='BibEntry'> |
| 73 |
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1617995">NNN98</a></span>] <b class='BibAuthor'>Newman, M. F., Nickel, W. and Niemeyer, A. C.</b>, |
| 74 |
<a href="https://doi.org/10.1006/jsco.1997.0193"><i class='BibTitle'>Descriptions of groups of prime-power order</i></a>, |
| 75 |
<span class='BibJournal'>J. Symbolic Comput.</span>, |
| 76 |
<em class='BibVolume'>25</em> (<span class='BibNumber'>5</span>) |
| 77 |
(<span class='BibYear'>1998</span>), |
| 78 |
<span class='BibPages'>665--682</span>. |
| 79 |
</p> |
| 80 |
|
| 81 |
|
| 82 |
<p><a id="biBNO96" name="biBNO96"></a></p> |
| 83 |
<p class='BibEntry'> |
| 84 |
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1419133">NO96</a></span>] <b class='BibAuthor'>Newman, M. F. and O'Brien, E. A.</b>, |
| 85 |
<a href="https://doi.org/10.1142/S0218196796000337"><i class='BibTitle'>Application of computers to questions like those of |
| 86 |
Burnside. II</i></a>, |
| 87 |
<span class='BibJournal'>Internat. J. Algebra Comput.</span>, |
| 88 |
<em class='BibVolume'>6</em> (<span class='BibNumber'>5</span>) |
| 89 |
(<span class='BibYear'>1996</span>), |
| 90 |
<span class='BibPages'>593--605</span>. |
| 91 |
</p> |
| 92 |
|
| 93 |
|
| 94 |
<p><a id="biBOBr90" name="biBOBr90"></a></p> |
| 95 |
<p class='BibEntry'> |
| 96 |
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1075431">O'B90</a></span>] <b class='BibAuthor'>O'Brien, E. A.</b>, |
| 97 |
<a href="https://doi.org/10.1016/S0747-7171(08)80082-X"><i class='BibTitle'>The p-group generation algorithm</i></a>, |
| 98 |
<span class='BibJournal'>J. Symbolic Comput.</span>, |
| 99 |
<em class='BibVolume'>9</em> (<span class='BibNumber'>5-6</span>) |
| 100 |
(<span class='BibYear'>1990</span>), |
| 101 |
<span class='BibPages'>677--698</span><br /> |
| 102 |
(<span class='BibNote'>Computational group theory, Part 1</span>). |
| 103 |
</p> |
| 104 |
|
| 105 |
|
| 106 |
<p><a id="biBOBr94" name="biBOBr94"></a></p> |
| 107 |
<p class='BibEntry'> |
| 108 |
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1283739">O'B94</a></span>] <b class='BibAuthor'>O'Brien, E. A.</b>, |
| 109 |
<a href="https://doi.org/10.1006/jsco.1994.1007"><i class='BibTitle'>Isomorphism testing for p-groups</i></a>, |
| 110 |
<span class='BibJournal'>J. Symbolic Comput.</span>, |
| 111 |
<em class='BibVolume'>17</em> (<span class='BibNumber'>2</span>) |
| 112 |
(<span class='BibYear'>1994</span>), |
| 113 |
<span class='BibPages'>131, 133--147</span>. |
| 114 |
</p> |
| 115 |
|
| 116 |
|
| 117 |
<p><a id="biBOBr95" name="biBOBr95"></a></p> |
| 118 |
<p class='BibEntry'> |
| 119 |
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1344923">O'B95</a></span>] <b class='BibAuthor'>O'Brien, E. A.</b>, |
| 120 |
<i class='BibTitle'>Computing automorphism groups of p-groups</i>, |
| 121 |
in <i class='BibBooktitle'>Computational algebra and number theory (Sydney, |
| 122 |
1992)</i>, |
| 123 |
<span class='BibPublisher'>Kluwer Acad. Publ.</span>, |
| 124 |
<span class='BibSeries'>Math. Appl.</span>, |
| 125 |
<em class='BibVolume'>325</em>, |
| 126 |
<span class='BibAddress'>Dordrecht</span> |
| 127 |
(<span class='BibYear'>1995</span>), |
| 128 |
<span class='BibPages'>83--90</span>. |
| 129 |
</p> |
| 130 |
|
| 131 |
|
| 132 |
<p><a id="biBSims94" name="biBSims94"></a></p> |
| 133 |
<p class='BibEntry'> |
| 134 |
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1267733">Sim94</a></span>] <b class='BibAuthor'>Sims, C. C.</b>, |
| 135 |
<a href="https://doi.org/10.1017/CBO9780511574702"><i class='BibTitle'>Computation with finitely presented groups</i></a>, |
| 136 |
<span class='BibPublisher'>Cambridge University Press</span>, |
| 137 |
<span class='BibSeries'>Encyclopedia of Mathematics and its Applications</span>, |
| 138 |
<em class='BibVolume'>48</em>, |
| 139 |
<span class='BibAddress'>Cambridge</span> |
| 140 |
(<span class='BibYear'>1994</span>), |
| 141 |
<span class='BibPages'>xiii+604 pages</span>. |
| 142 |
</p> |
| 143 |
|
| 144 |
|
| 145 |
<p><a id="biBVL84" name="biBVL84"></a></p> |
| 146 |
<p class='BibEntry'> |
| 147 |
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=760652">Vau84</a></span>] <b class='BibAuthor'>Vaughan-Lee, M. R.</b>, |
| 148 |
<i class='BibTitle'>An aspect of the nilpotent quotient algorithm</i>, |
| 149 |
in <i class='BibBooktitle'>Computational group theory (Durham, 1982)</i>, |
| 150 |
<span class='BibPublisher'>Academic Press</span>, |
| 151 |
<span class='BibAddress'>London</span> |
| 152 |
(<span class='BibYear'>1984</span>), |
| 153 |
<span class='BibPages'>75--83</span>. |
| 154 |
</p> |
| 155 |
|
| 156 |
|
| 157 |
<p><a id="biBVL90b" name="biBVL90b"></a></p> |
| 158 |
<p class='BibEntry'> |
| 159 |
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1057610">Vau90a</a></span>] <b class='BibAuthor'>Vaughan-Lee, M.</b>, |
| 160 |
<i class='BibTitle'>The restricted Burnside problem</i>, |
| 161 |
<span class='BibPublisher'>The Clarendon Press Oxford University Press</span>, |
| 162 |
<span class='BibSeries'>London Mathematical Society Monographs. New Series</span>, |
| 163 |
<em class='BibVolume'>5</em>, |
| 164 |
<span class='BibAddress'>New York</span> |
| 165 |
(<span class='BibYear'>1990</span>), |
| 166 |
<span class='BibPages'>xiv+209 pages</span><br /> |
| 167 |
(<span class='BibNote'>Oxford Science Publications</span>). |
| 168 |
</p> |
| 169 |
|
| 170 |
|
| 171 |
<p><a id="biBVL90a" name="biBVL90a"></a></p> |
| 172 |
<p class='BibEntry'> |
| 173 |
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1075434">Vau90b</a></span>] <b class='BibAuthor'>Vaughan-Lee, M. R.</b>, |
| 174 |
<a href="https://doi.org/10.1016/S0747-7171(08)80085-5"><i class='BibTitle'>Collection from the left</i></a>, |
| 175 |
<span class='BibJournal'>J. Symbolic Comput.</span>, |
| 176 |
<em class='BibVolume'>9</em> (<span class='BibNumber'>5-6</span>) |
| 177 |
(<span class='BibYear'>1990</span>), |
| 178 |
<span class='BibPages'>725--733</span><br /> |
| 179 |
(<span class='BibNote'>Computational group theory, Part 1</span>). |
| 180 |
</p> |
| 181 |
|
| 182 |
<p> </p> |
| 183 |
|
| 184 |
|
| 185 |
<div class="chlinkprevnextbot"> <a href="chap0.html">[Top of Book]</a> <a href="chap0.html#contents">[Contents]</a> <a href="chapA.html">[Previous Chapter]</a> <a href="chapInd.html">[Next Chapter]</a> </div> |
| 186 |
|
| 187 |
|
| 188 |
<div class="chlinkbot"><span class="chlink1">Goto Chapter: </span><a href="chap0.html">Top</a> <a href="chap1.html">1</a> <a href="chap2.html">2</a> <a href="chap3.html">3</a> <a href="chap4.html">4</a> <a href="chap5.html">5</a> <a href="chap6.html">6</a> <a href="chap7.html">7</a> <a href="chapA.html">A</a> <a href="chapBib.html">Bib</a> <a href="chapInd.html">Ind</a> </div> |
| 189 |
|
| 190 |
<hr /> |
| 191 |
<p class="foot">generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p> |
| 192 |
</body> |
| 193 |
</html> |