Gedichte Musik Bilder Quellcodebibliothek Diashow Normaldarstellung
Quellcodebibliothek Statistik Leitseite products/Sources/formale Sprachen/C/Firefox/xpcom/build/   (Browser von der Mozilla Stiftung Version 136.0.1©)  Datei vom 10.2.2025 mit Größe 7 kB image not shown  

Quellcode-Bibliothek chapBib.html   Sprache: HTML

 
 products/Sources/formale Sprachen/GAP/pkg/anupq/doc/chapBib.html


<?xml version="1.0" encoding="UTF-8"?>

<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"
         "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">

<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
<head>
<title>GAP (ANUPQ) - References</title>
<meta http-equiv="content-type" content="text/html; charset=UTF-8" />
<meta name="generator" content="GAPDoc2HTML" />
<link rel="stylesheet" type="text/css" href="manual.css" />
<script src="manual.js" type="text/javascript"></script>
<script type="text/javascript">overwriteStyle();</script>
</head>
<body class="chapBib"  onload="jscontent()">


<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>

<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>

<p id="mathjaxlink" class="pcenter"><a href="chapBib_mj.html">[MathJax on]</a></p>
<p><a id="X7A6F98FD85F02BFE" name="X7A6F98FD85F02BFE"></a></p>

<h3>References</h3>


<p><a id="biBHN80" name="biBHN80"></a></p>
<p class='BibEntry'>
[<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>,
 <i class='BibTitle'>Application of computers to questions like those of
              Burnside</i>,
  in  <i class='BibBooktitle'>Burnside groups (Proc. Workshop, Univ.
      Bielefeld,
              Bielefeld, 1977)</i>,
 <span class='BibPublisher'>Springer</span>,
 <span class='BibSeries'>Lecture Notes in Math.</span>,
 <em class='BibVolume'>806</em>,
 <span class='BibAddress'>Berlin</span>
 (<span class='BibYear'>1980</span>),
 <span class='BibPages'>211--230</span>.
</p>


<p><a id="biBLGS90" name="biBLGS90"></a></p>
<p class='BibEntry'>
[<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>,
<a href="https://doi.org/10.1016/S0747-7171(08)80081-8"><i class='BibTitle'>Collection from the left and other strategies</i></a>,
 <span class='BibJournal'>J. Symbolic Comput.</span>,
 <em class='BibVolume'>9</em> (<span class='BibNumber'>5-6</span>)
 (<span class='BibYear'>1990</span>),
 <span class='BibPages'>665--675</span><br />
(<span class='BibNote'>Computational group theory, Part 1</span>).
</p>


<p><a id="biBNew77" name="biBNew77"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=0453862">New77</a></span>]   <b class='BibAuthor'>Newman, M. F.</b>,
 <i class='BibTitle'>Determination of groups of prime-power order</i>,
  in  <i class='BibBooktitle'>Group theory (Proc. Miniconf., Australian
      Nat.
              Univ., Canberra, 1975)</i>,
 <span class='BibPublisher'>Springer</span>,
 <span class='BibAddress'>Berlin</span>
 (<span class='BibYear'>1977</span>),
 <span class='BibPages'>73--84. Lecture Notes in Math., Vol. 573</span>.
</p>


<p><a id="biBNNN98" name="biBNNN98"></a></p>
<p class='BibEntry'>
[<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>,
<a href="https://doi.org/10.1006/jsco.1997.0193"><i class='BibTitle'>Descriptions of groups of prime-power order</i></a>,
 <span class='BibJournal'>J. Symbolic Comput.</span>,
 <em class='BibVolume'>25</em> (<span class='BibNumber'>5</span>)
 (<span class='BibYear'>1998</span>),
 <span class='BibPages'>665--682</span>.
</p>


<p><a id="biBNO96" name="biBNO96"></a></p>
<p class='BibEntry'>
[<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.,
<a href="https://doi.org/10.1142/S0218196796000337"><i class='BibTitle'>Application of computers to questions like those of
              Burnside. II</i></a>,
 <span class='BibJournal'>Internat. J. Algebra Comput.</span>,
 <em class='BibVolume'>6</em> (<span class='BibNumber'>5</span>)
 (<span class='BibYear'>1996</span>),
 <span class='BibPages'>593--605</span>.
</p>


<p><a id="biBOBr90" name="biBOBr90"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1075431">O'B90] '>O'Brien, E. A.</b>,
<a href="https://doi.org/10.1016/S0747-7171(08)80082-X"><i class='BibTitle'>The p-group generation algorithm</i></a>,
 <span class='BibJournal'>J. Symbolic Comput.</span>,
 <em class='BibVolume'>9</em> (<span class='BibNumber'>5-6</span>)
 (<span class='BibYear'>1990</span>),
 <span class='BibPages'>677--698</span><br />
(<span class='BibNote'>Computational group theory, Part 1</span>).
</p>


<p><a id="biBOBr94" name="biBOBr94"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1283739">O'B94] '>O'Brien, E. A.</b>,
<a href="https://doi.org/10.1006/jsco.1994.1007"><i class='BibTitle'>Isomorphism testing for p-groups</i></a>,
 <span class='BibJournal'>J. Symbolic Comput.</span>,
 <em class='BibVolume'>17</em> (<span class='BibNumber'>2</span>)
 (<span class='BibYear'>1994</span>),
 <span class='BibPages'>131, 133--147</span>.
</p>


<p><a id="biBOBr95" name="biBOBr95"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1344923">O'B95] '>O'Brien, E. A.</b>,
 <i class='BibTitle'>Computing automorphism groups of p-groups</i>,
  in  <i class='BibBooktitle'>Computational algebra and number theory (Sydney,
      1992)</i>,
 <span class='BibPublisher'>Kluwer Acad. Publ.</span>,
 <span class='BibSeries'>Math. Appl.</span>,
 <em class='BibVolume'>325</em>,
 <span class='BibAddress'>Dordrecht</span>
 (<span class='BibYear'>1995</span>),
 <span class='BibPages'>83--90</span>.
</p>


<p><a id="biBSims94" name="biBSims94"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1267733">Sim94</a></span>]   <b class='BibAuthor'>Sims, C. C.</b>,
<a href="https://doi.org/10.1017/CBO9780511574702"><i class='BibTitle'>Computation with finitely presented groups</i></a>,
 <span class='BibPublisher'>Cambridge University Press</span>,
 <span class='BibSeries'>Encyclopedia of Mathematics and its Applications</span>,
 <em class='BibVolume'>48</em>,
 <span class='BibAddress'>Cambridge</span>
 (<span class='BibYear'>1994</span>),
 <span class='BibPages'>xiii+604 pages</span>.
</p>


<p><a id="biBVL84" name="biBVL84"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=760652">Vau84</a></span>]   <b class='BibAuthor'>Vaughan-Lee, M. R.</b>,
 <i class='BibTitle'>An aspect of the nilpotent quotient algorithm</i>,
  in  <i class='BibBooktitle'>Computational group theory (Durham, 1982)</i>,
 <span class='BibPublisher'>Academic Press</span>,
 <span class='BibAddress'>London</span>
 (<span class='BibYear'>1984</span>),
 <span class='BibPages'>75--83</span>.
</p>


<p><a id="biBVL90b" name="biBVL90b"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1057610">Vau90a</a></span>]   <b class='BibAuthor'>Vaughan-Lee, M.</b>,
 <i class='BibTitle'>The restricted Burnside problem</i>,
 <span class='BibPublisher'>The Clarendon Press Oxford University Press</span>,
 <span class='BibSeries'>London Mathematical Society Monographs. New Series</span>,
 <em class='BibVolume'>5</em>,
 <span class='BibAddress'>New York</span>
 (<span class='BibYear'>1990</span>),
 <span class='BibPages'>xiv+209 pages</span><br />
(<span class='BibNote'>Oxford Science Publications</span>).
</p>


<p><a id="biBVL90a" name="biBVL90a"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1075434">Vau90b</a></span>]   <b class='BibAuthor'>Vaughan-Lee, M. R.</b>,
<a href="https://doi.org/10.1016/S0747-7171(08)80085-5"><i class='BibTitle'>Collection from the left</i></a>,
 <span class='BibJournal'>J. Symbolic Comput.</span>,
 <em class='BibVolume'>9</em> (<span class='BibNumber'>5-6</span>)
 (<span class='BibYear'>1990</span>),
 <span class='BibPages'>725--733</span><br />
(<span class='BibNote'>Computational group theory, Part 1</span>).
</p>

<p> </p>


<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>


<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>

<hr />
<p class="foot">generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a></p>
</body>
</html>

100%


¤ Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.0.14Bemerkung:  (vorverarbeitet)  ¤

*Bot Zugriff




über den Urheber dieser Seite

Die Firma ist wie angegeben erreichbar.

Beweissystem der NASA

Beweissystem Isabelle

NIST Cobol Testsuite

Cephes Mathematical Library

Wiener Entwicklungsmethode

Haftungshinweis

Die Informationen auf dieser Webseite wurden nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit, noch Qualität der bereit gestellten Informationen zugesichert.

Bemerkung:

Die farbliche Syntaxdarstellung ist noch experimentell.