Ziele Untersuchung
mit Columbo Integrität von
Datenbanken Interaktion und
Portierbarkeit Ergonomie der
Schnittstellen

Angebot Produkte Projekt Beratung

Mittel Analytik Modellierung Sprachen Algebra Logik Hardware Denken Kreativität

Zusammenhänge Gesellschaft Wirtschaft Branche Firma


products/Sources/formale Sprachen/GAP/pkg/anupq/doc/ (Algebra von RWTH Aachen Version 4.15.1^©) Datei vom 28.7.2025 mit Größe 9 kB

SSL chapBib.html Interaktion und
PortierbarkeitHTML

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">Goto Chapter: <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>

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

<h3>References</h3>

<a id="biBHN80" name="biBHN80"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=586047">HN80</a>] Havas, G. and Newman, M. F.,
Application of computers to questions like those of
 Burnside,
 in Burnside groups (Proc. Workshop, Univ.
 Bielefeld,
 Bielefeld, 1977),
Springer,
Lecture Notes in Math.,
806,
Berlin
(1980),
211--230.


<a id="biBLGS90" name="biBLGS90"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1075430">LS90</a>] Leedham-Green, C. R. and Soicher, L. H.,
<a href="https://doi.org/10.1016/S0747-7171(08)80081-8">Collection from the left and other strategies</a>,
J. Symbolic Comput.,
9 (5-6)
(1990),
665--675 
(Computational group theory, Part 1).


<a id="biBNew77" name="biBNew77"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=0453862">New77</a>] Newman, M. F.,
Determination of groups of prime-power order,
 in Group theory (Proc. Miniconf., Australian
 Nat.
 Univ., Canberra, 1975),
Springer,
Berlin
(1977),
73--84. Lecture Notes in Math., Vol. 573.


<a id="biBNNN98" name="biBNNN98"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1617995">NNN98</a>] Newman, M. F., Nickel, W. and Niemeyer, A. C.,
<a href="https://doi.org/10.1006/jsco.1997.0193">Descriptions of groups of prime-power order</a>,
J. Symbolic Comput.,
25 (5)
(1998),
665--682.


<a id="biBNO96" name="biBNO96"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1419133">NO96</a>] Newman, M. F. and O'Brien, E. A.,
<a href="https://doi.org/10.1142/S0218196796000337">Application of computers to questions like those of
 Burnside. II</a>,
Internat. J. Algebra Comput.,
6 (5)
(1996),
593--605.


<a id="biBOBr90" name="biBOBr90"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1075431">O'B90] '>O'Brien, E. A.,
<a href="https://doi.org/10.1016/S0747-7171(08)80082-X">The p-group generation algorithm</a>,
J. Symbolic Comput.,
9 (5-6)
(1990),
677--698 
(Computational group theory, Part 1).


<a id="biBOBr94" name="biBOBr94"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1283739">O'B94] '>O'Brien, E. A.,
<a href="https://doi.org/10.1006/jsco.1994.1007">Isomorphism testing for p-groups</a>,
J. Symbolic Comput.,
17 (2)
(1994),
131, 133--147.


<a id="biBOBr95" name="biBOBr95"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1344923">O'B95] '>O'Brien, E. A.,
Computing automorphism groups of p-groups,
 in Computational algebra and number theory (Sydney,
 1992),
Kluwer Acad. Publ.,
Math. Appl.,
325,
Dordrecht
(1995),
83--90.


<a id="biBSims94" name="biBSims94"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1267733">Sim94</a>] Sims, C. C.,
<a href="https://doi.org/10.1017/CBO9780511574702">Computation with finitely presented groups</a>,
Cambridge University Press,
Encyclopedia of Mathematics and its Applications,
48,
Cambridge
(1994),
xiii+604 pages.


<a id="biBVL84" name="biBVL84"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=760652">Vau84</a>] Vaughan-Lee, M. R.,
An aspect of the nilpotent quotient algorithm,
 in Computational group theory (Durham, 1982),
Academic Press,
London
(1984),
75--83.


<a id="biBVL90b" name="biBVL90b"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1057610">Vau90a</a>] Vaughan-Lee, M.,
The restricted Burnside problem,
The Clarendon Press Oxford University Press,
London Mathematical Society Monographs. New Series,
5,
New York
(1990),
xiv+209 pages 
(Oxford Science Publications).


<a id="biBVL90a" name="biBVL90a"></a>

[<a href="https://www.ams.org/mathscinet-getitem?mr=1075434">Vau90b</a>] Vaughan-Lee, M. R.,
<a href="https://doi.org/10.1016/S0747-7171(08)80085-5">Collection from the left</a>,
J. Symbolic Comput.,
9 (5-6)
(1990),
725--733 
(Computational group theory, Part 1).


 

<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">Goto Chapter: <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 />
generated by <a href="https://www.math.rwth-aachen.de/~Frank.Luebeck/GAPDoc">GAPDoc2HTML</a>
</body>
</html>

quality100%

¤ Diese beiden folgenden Angebotsgruppen bietet das Unternehmen0.29Angebot Wie Sie bei der Firma Beratungs- und Dienstleistungen beauftragen können ¤

*Eine klare Vorstellung vom Zielzustand

Wurzel

Suchen

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.