Eine aufbereitete Darstellung der Quelle

 
     
 
 
Anforderungen  |   Konzepte  |   Entwurf  |   Entwicklung  |   Qualitätssicherung  |   Lebenszyklus  |   Steuerung
 
 
 
 

Benutzer

SSL chapBib_mj.html  Interaktion und
Portierbarkeitunbekannt

 
Untersuchungsergebnis.html Download desDelphi {Delphi[72] SPS[63] CS[54]}

<?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>
<script type="text/javascript"
  src="https://cdn.jsdelivr.net/npm/mathjax@2/MathJax.js?config=TeX-AMS-MML_HTMLorMML">
</script>
<title>GAP (recog) - 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_mj.html">Top</a>  <a href="chap1_mj.html">1</a>  <a href="chap2_mj.html">2</a>  <a href="chap3_mj.html">3</a>  <a href="chap4_mj.html">4</a>  <a href="chap5_mj.html">5</a>  <a href="chap6_mj.html">6</a>  <a href="chap7_mj.html">7</a>  <a href="chap8_mj.html">8</a>  <a href="chap9_mj.html">9</a>  <a href="chapBib_mj.html">Bib</a>  <a href="chapInd_mj.html">Ind</a>  </div>

<div class="chlinkprevnexttop"> <a href="chap0_mj.html">[Top of Book]</a>   <a href="chap0_mj.html#contents">[Contents]</a>    <a href="chap9_mj.html">[Previous Chapter]</a>    <a href="chapInd_mj.html">[Next Chapter]</a>   </div>

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

<h3>References</h3>


<p><a id="biBAB01" name="biBAB01"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1829468">AB01</a></span>]   <b class='BibAuthor'>Altseimer, C. and Borovik, A. V.</b>,
 <i class='BibTitle'>Probabilistic recognition of orthogonal and symplectic groups</i>,
  in  <i class='BibBooktitle'>Groups and computation, III (Columbus, OH,
      1999)</i>,
 <span class='BibPublisher'>de Gruyter, Berlin</span>,
 <em class='BibVolume'>8</em>
 (<span class='BibYear'>2001</span>),
 <span class='BibPages'>1–20</span>.
</p>


<p><a id="biBBB99" name="biBBB99"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1676609">BB99</a></span>]   <b class='BibAuthor'>Babai, L. and Beals, R.</b>,
 <i class='BibTitle'>A polynomial-time theory of black box groups. I</i>,
  in  <i class='BibBooktitle'>Groups St. Andrews 1997 in Bath,
      I</i>,
 <span class='BibPublisher'>Cambridge Univ. Press, Cambridge</span>,
 <span class='BibSeries'>London Math. Soc. Lecture Note Ser.</span>,
 <em class='BibVolume'>260</em>
 (<span class='BibYear'>1999</span>),
 <span class='BibPages'>30–64</span>.
</p>


<p><a id="biBBBS09" name="biBBBS09"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=2780050">BBS09</a></span>]   <b class='BibAuthor'>Babai, L., Beals, R. and Seress, Á.</b>,
 <i class='BibTitle'>Polynomial-time theory of matrix groups</i>,
  in  <i class='BibBooktitle'>STOC'09–-Proceedings of the 2009 ACM
      International
  Symposium on Theory of Computing</i>,
 <span class='BibPublisher'>ACM, New York</span>
 (<span class='BibYear'>2009</span>),
 <span class='BibPages'>55–64</span>.
</p>


<p><a id="biBBHLGO15" name="biBBHLGO15"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=3283836">BHLO15</a></span>]   <b class='BibAuthor'>Bäärnhielm, H., Holt, D., Leedham-Green, C. R. and O'Brien, E. A.</b>,
 <i class='BibTitle'>A practical model for computation with matrix groups</i>,
 <span class='BibJournal'>J. Symbolic Comput.</span>,
 <em class='BibVolume'>68</em> (<span class='BibNumber'>part 1</span>)
 (<span class='BibYear'>2015</span>),
 <span class='BibPages'>27–60</span><br />
(<span class='BibNote'>https://doi.org/10.1016/j.jsc.2014.08.006</span>).
</p>


<p><a id="biBBK01" name="biBBK01"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1829473">BK01</a></span>]   <b class='BibAuthor'>Brooksbank, P. A. and Kantor, W. M.</b>,
 <i class='BibTitle'>On constructive recognition of a black box \({\rm
      PSL}(d,q)\)</i>,
  in  <i class='BibBooktitle'>Groups and computation, III (Columbus, OH,
      1999)</i>,
 <span class='BibPublisher'>de Gruyter, Berlin</span>,
 <span class='BibSeries'>Ohio State Univ. Math. Res. Inst. Publ.</span>,
 <em class='BibVolume'>8</em>
 (<span class='BibYear'>2001</span>),
 <span class='BibPages'>95–111</span>.
</p>


<p><a id="biBBK06" name="biBBK06"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=2228648">BK06</a></span>]   <b class='BibAuthor'>Brooksbank, P. A. and Kantor, W. M.</b>,
 <i class='BibTitle'>Fast constructive recognition of black box orthogonal groups</i>,
 <span class='BibJournal'>J. Algebra</span>,
 <em class='BibVolume'>300</em> (<span class='BibNumber'>1</span>)
 (<span class='BibYear'>2006</span>),
 <span class='BibPages'>256–288</span><br />
(<span class='BibNote'>https://doi.org/10.1016/j.jalgebra.2006.02.024</span>).
</p>


<p><a id="biBBKPS02" name="biBBKPS02"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1931364">BKPS02</a></span>]   <b class='BibAuthor'>Babai, L., Kantor, W. M., Pálfy, P. P. and Seress, Á.</b>,
 <i class='BibTitle'>Black-box recognition of finite simple groups of Lie type by
            statistics of element orders</i>,
 <span class='BibJournal'>J. Group Theory</span>,
 <em class='BibVolume'>5</em> (<span class='BibNumber'>4</span>)
 (<span class='BibYear'>2002</span>),
 <span class='BibPages'>383–401</span><br />
(<span class='BibNote'>https://doi.org/10.1515/jgth.2002.010</span>).
</p>


<p><a id="biBBLGN+03" name="biBBLGN+03"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1953539">BLN+03</a></span>]   <b class='BibAuthor'>Beals, R., Leedham-Green, C. R., Niemeyer, A. C., Praeger, C. E. and Seress, Á.</b>,
 <i class='BibTitle'>A black-box group algorithm for recognizing finite symmetric
              and alternating groups. I</i>,
 <span class='BibJournal'>Trans. Amer. Math. Soc.</span>,
 <em class='BibVolume'>355</em> (<span class='BibNumber'>5</span>)
 (<span class='BibYear'>2003</span>),
 <span class='BibPages'>2097–2113</span><br />
(<span class='BibNote'>https://doi.org/10.1090/S0002-9947-03-03040-X</span>).
</p>


<p><a id="biBBLGN+05" name="biBBLGN+05"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=2166794">BLN+05</a></span>]   <b class='BibAuthor'>Beals, R., Leedham-Green, C. R., Niemeyer, A. C., Praeger, C. E. and Seress, Á.</b>,
 <i class='BibTitle'>Constructive recognition of finite alternating and symmetric
              groups acting as matrix groups on their natural permutation
              modules</i>,
 <span class='BibJournal'>J. Algebra</span>,
 <em class='BibVolume'>292</em> (<span class='BibNumber'>1</span>)
 (<span class='BibYear'>2005</span>),
 <span class='BibPages'>4–46</span><br />
(<span class='BibNote'>https://doi.org/10.1016/j.jalgebra.2005.01.035</span>).
</p>


<p><a id="biBBLS97" name="biBBLS97"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1471984">BLS97</a></span>]   <b class='BibAuthor'>Babai, L., Luks, E. M. and Seress, Á.</b>,
 <i class='BibTitle'>Fast management of permutation groups. I</i>,
 <span class='BibJournal'>SIAM J. Comput.</span>,
 <em class='BibVolume'>26</em> (<span class='BibNumber'>5</span>)
 (<span class='BibYear'>1997</span>),
 <span class='BibPages'>1310–1342</span><br />
(<span class='BibNote'>https://doi.org/10.1137/S0097539794229417</span>).
</p>


<p><a id="biBBNS06" name="biBBNS06"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=2257997">BNS06</a></span>]   <b class='BibAuthor'>Brooksbank, P., Niemeyer, A. C. and Seress, Á.</b>,
 <i class='BibTitle'>A reduction algorithm for matrix groups with an extraspecial
              normal subgroup</i>,
  in  <i class='BibBooktitle'>Finite geometries, groups, and computation</i>,
 <span class='BibPublisher'>Walter de Gruyter, Berlin</span>
 (<span class='BibYear'>2006</span>),
 <span class='BibPages'>1–16</span>.
</p>


<p><a id="biBBro01" name="biBBro01"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1829472">Bro01</a></span>]   <b class='BibAuthor'>Brooksbank, P. A.</b>,
 <i class='BibTitle'>A constructive recognition algorithm for the matrix group
              \(\Omega(d,q)\)</i>,
  in  <i class='BibBooktitle'>Groups and computation, III (Columbus, OH,
      1999)</i>,
 <span class='BibPublisher'>de Gruyter, Berlin</span>,
 <span class='BibSeries'>Ohio State Univ. Math. Res. Inst. Publ.</span>,
 <em class='BibVolume'>8</em>
 (<span class='BibYear'>2001</span>),
 <span class='BibPages'>79–93</span>.
</p>


<p><a id="biBBro03" name="biBBro03"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=2051584">Bro03</a></span>]   <b class='BibAuthor'>Brooksbank, P. A.</b>,
 <i class='BibTitle'>Fast constructive recognition of black-box unitary groups</i>,
 <span class='BibJournal'>LMS J. Comput. Math.</span>,
 <em class='BibVolume'>6</em>
 (<span class='BibYear'>2003</span>),
 <span class='BibPages'>162–197</span><br />
(<span class='BibNote'>https://doi.org/10.1112/S1461157000000437</span>).
</p>


<p><a id="biBBro08" name="biBBro08"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=2422320">Bro08</a></span>]   <b class='BibAuthor'>Brooksbank, P. A.</b>,
 <i class='BibTitle'>Fast constructive recognition of black box symplectic groups</i>,
 <span class='BibJournal'>J. Algebra</span>,
 <em class='BibVolume'>320</em> (<span class='BibNumber'>2</span>)
 (<span class='BibYear'>2008</span>),
 <span class='BibPages'>885–909</span><br />
(<span class='BibNote'>https://doi.org/10.1016/j.jalgebra.2008.03.021</span>).
</p>


<p><a id="biBBS01" name="biBBS01"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1829470">BS01</a></span>]   <b class='BibAuthor'>Babai, L. and Shalev, A.</b>,
 <i class='BibTitle'>Recognizing simplicity of black-box groups and the frequency
              of \(p\)-singular elements in affine groups</i>,
  in  <i class='BibBooktitle'>Groups and computation, III (Columbus, OH,
      1999)</i>,
 <span class='BibPublisher'>de Gruyter, Berlin</span>,
 <span class='BibSeries'>Ohio State Univ. Math. Res. Inst. Publ.</span>,
 <em class='BibVolume'>8</em>
 (<span class='BibYear'>2001</span>),
 <span class='BibPages'>39–62</span>.
</p>


<p><a id="biBCFL97" name="biBCFL97"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1444132">CFL97</a></span>]   <b class='BibAuthor'>Cooperman, G., Finkelstein, L. and Linton, S.</b>,
 <i class='BibTitle'>Constructive recognition of a black box group isomorphic to
              \({\rm GL}(n,2)\)</i>,
  in  <i class='BibBooktitle'>Groups and computation, II (New Brunswick,
      NJ, 1995)</i>,
 <span class='BibPublisher'>Amer. Math. Soc., Providence, RI</span>,
 <span class='BibSeries'>DIMACS Ser. Discrete Math. Theoret. Comput. Sci.</span>,
 <em class='BibVolume'>28</em>
 (<span class='BibYear'>1997</span>),
 <span class='BibPages'>85–100</span>.
</p>


<p><a id="biBCLG97a" name="biBCLG97a"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1444130">CL97a</a></span>]   <b class='BibAuthor'>Celler, F. and Leedham-Green, C. R.</b>,
 <i class='BibTitle'>Calculating the order of an invertible matrix</i>,
  in  <i class='BibBooktitle'>Groups and computation, II (New Brunswick,
      NJ, 1995)</i>,
 <span class='BibPublisher'>Amer. Math. Soc., Providence, RI</span>,
 <span class='BibSeries'>DIMACS Ser. Discrete Math. Theoret. Comput. Sci.</span>,
 <em class='BibVolume'>28</em>
 (<span class='BibYear'>1997</span>),
 <span class='BibPages'>55–60</span>.
</p>


<p><a id="biBCLG97b" name="biBCLG97b"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1444131">CL97b</a></span>]   <b class='BibAuthor'>Celler, F. and Leedham-Green, C. R.</b>,
 <i class='BibTitle'>A non-constructive recognition algorithm for the special
              linear and other classical groups</i>,
  in  <i class='BibBooktitle'>Groups and computation, II (New Brunswick,
      NJ, 1995)</i>,
 <span class='BibPublisher'>Amer. Math. Soc., Providence, RI</span>,
 <span class='BibSeries'>DIMACS Ser. Discrete Math. Theoret. Comput. Sci.</span>,
 <em class='BibVolume'>28</em>
 (<span class='BibYear'>1997</span>),
 <span class='BibPages'>61–67</span>.
</p>


<p><a id="biBCLG98" name="biBCLG98"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1647410">CL98</a></span>]   <b class='BibAuthor'>Celler, F. and Leedham-Green, C. R.</b>,
 <i class='BibTitle'>A constructive recognition algorithm for the special linear
              group</i>,
  in  <i class='BibBooktitle'>The atlas of finite groups: ten years on (Birmingham,
      1995)</i>,
 <span class='BibPublisher'>Cambridge Univ. Press, Cambridge</span>,
 <span class='BibSeries'>London Math. Soc. Lecture Note Ser.</span>,
 <em class='BibVolume'>249</em>
 (<span class='BibYear'>1998</span>),
 <span class='BibPages'>11–26</span><br />
(<span class='BibNote'>https://doi.org/10.1017/CBO9780511565830.007</span>).
</p>


<p><a id="biBCLG01" name="biBCLG01"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1829474">CL01</a></span>]   <b class='BibAuthor'>Conder, M. and Leedham-Green, C. R.</b>,
 <i class='BibTitle'>Fast recognition of classical groups over large fields</i>,
  in  <i class='BibBooktitle'>Groups and computation, III (Columbus, OH,
      1999)</i>,
 <span class='BibPublisher'>de Gruyter, Berlin</span>,
 <span class='BibSeries'>Ohio State Univ. Math. Res. Inst. Publ.</span>,
 <em class='BibVolume'>8</em>
 (<span class='BibYear'>2001</span>),
 <span class='BibPages'>113–121</span>.
</p>


<p><a id="biBCLGM+95" name="biBCLGM+95"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1356111">CLM+95</a></span>]   <b class='BibAuthor'>Celler, F., Leedham-Green, C. R., Murray, S. H., Niemeyer, A. C. and O'Brien, E. A.</b>,
 <i class='BibTitle'>Generating random elements of a finite group</i>,
 <span class='BibJournal'>Comm. Algebra</span>,
 <em class='BibVolume'>23</em> (<span class='BibNumber'>13</span>)
 (<span class='BibYear'>1995</span>),
 <span class='BibPages'>4931–4948</span><br />
(<span class='BibNote'>https://doi.org/10.1080/00927879508825509</span>).
</p>


<p><a id="biBCLGO06" name="biBCLGO06"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=2187651">CLO06</a></span>]   <b class='BibAuthor'>Conder, M. D. E., Leedham-Green, C. R. and O'Brien, E. A.</b>,
 <i class='BibTitle'>Constructive recognition of \({\rm PSL}(2,q)\)</i>,
 <span class='BibJournal'>Trans. Amer. Math. Soc.</span>,
 <em class='BibVolume'>358</em> (<span class='BibNumber'>3</span>)
 (<span class='BibYear'>2006</span>),
 <span class='BibPages'>1203–1221</span><br />
(<span class='BibNote'>https://doi.org/10.1090/S0002-9947-05-03756-6</span>).
</p>


<p><a id="biBCNRD09" name="biBCNRD09"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=2531214">CNR09</a></span>]   <b class='BibAuthor'>Carlson, J. F., Neunhöffer, M. and Roney-Dougal, C. M.</b>,
 <i class='BibTitle'>A polynomial-time reduction algorithm for groups of semilinear
              or subfield class</i>,
 <span class='BibJournal'>J. Algebra</span>,
 <em class='BibVolume'>322</em> (<span class='BibNumber'>3</span>)
 (<span class='BibYear'>2009</span>),
 <span class='BibPages'>613–637</span><br />
(<span class='BibNote'>https://doi.org/10.1016/j.jalgebra.2009.04.022</span>).
</p>


<p><a id="biBDLGLO13" name="biBDLGLO13"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=3081630">DLLO13</a></span>]   <b class='BibAuthor'>Dietrich, H., Leedham-Green, C. R., Lübeck, F. and O'Brien, E. A.</b>,
 <i class='BibTitle'>Constructive recognition of classical groups in even
              characteristic</i>,
 <span class='BibJournal'>J. Algebra</span>,
 <em class='BibVolume'>391</em>
 (<span class='BibYear'>2013</span>),
 <span class='BibPages'>227–255</span><br />
(<span class='BibNote'>https://doi.org/10.1016/j.jalgebra.2013.04.031</span>).
</p>


<p><a id="biBDLGO15" name="biBDLGO15"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=3272392">DLO15</a></span>]   <b class='BibAuthor'>Dietrich, H., Leedham-Green, C. R. and O'Brien, E. A.</b>,
 <i class='BibTitle'>Effective black-box constructive recognition of classical
              groups</i>,
 <span class='BibJournal'>J. Algebra</span>,
 <em class='BibVolume'>421</em>
 (<span class='BibYear'>2015</span>),
 <span class='BibPages'>460–492</span><br />
(<span class='BibNote'>https://doi.org/10.1016/j.jalgebra.2014.08.039</span>).
</p>


<p><a id="biBGH97" name="biBGH97"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1446124">GH97</a></span>]   <b class='BibAuthor'>Glasby, S. P. and Howlett, R. B.</b>,
 <i class='BibTitle'>Writing representations over minimal fields</i>,
 <span class='BibJournal'>Comm. Algebra</span>,
 <em class='BibVolume'>25</em> (<span class='BibNumber'>6</span>)
 (<span class='BibYear'>1997</span>),
 <span class='BibPages'>1703–1711</span><br />
(<span class='BibNote'>https://doi.org/10.1080/00927879708825947</span>).
</p>


<p><a id="biBGLGO06" name="biBGLGO06"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=2188850">GLO06</a></span>]   <b class='BibAuthor'>Glasby, S. P., Leedham-Green, C. R. and O'Brien, E. A.</b>,
 <i class='BibTitle'>Writing projective representations over subfields</i>,
 <span class='BibJournal'>J. Algebra</span>,
 <em class='BibVolume'>295</em> (<span class='BibNumber'>1</span>)
 (<span class='BibYear'>2006</span>),
 <span class='BibPages'>51–61</span><br />
(<span class='BibNote'>https://doi.org/10.1016/j.jalgebra.2005.03.037</span>).
</p>


<p><a id="biBHLO+08" name="biBHLO+08"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=2466905">HLO+08</a></span>]   <b class='BibAuthor'>Holmes, P. E., Linton, S. A., O'Brien, E. A., Ryba, A. J. E. and Wilson, R. A.</b>,
 <i class='BibTitle'>Constructive membership in black-box groups</i>,
 <span class='BibJournal'>J. Group Theory</span>,
 <em class='BibVolume'>11</em> (<span class='BibNumber'>6</span>)
 (<span class='BibYear'>2008</span>),
 <span class='BibPages'>747–763</span><br />
(<span class='BibNote'>https://doi.org/10.1515/JGT.2008.047</span>).
</p>


<p><a id="biBHLGOR96a" name="biBHLGOR96a"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1407872">HLOR96a</a></span>]   <b class='BibAuthor'>Holt, D. F., Leedham-Green, C. R., O'Brien, E. A. and Rees, S.</b>,
 <i class='BibTitle'>Computing matrix group decompositions with respect to a normal
              subgroup</i>,
 <span class='BibJournal'>J. Algebra</span>,
 <em class='BibVolume'>184</em> (<span class='BibNumber'>3</span>)
 (<span class='BibYear'>1996</span>),
 <span class='BibPages'>818–838</span><br />
(<span class='BibNote'>https://doi.org/10.1006/jabr.1996.0286</span>).
</p>


<p><a id="biBHLGOR96b" name="biBHLGOR96b"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1407871">HLOR96b</a></span>]   <b class='BibAuthor'>Holt, D. F., Leedham-Green, C. R., O'Brien, E. A. and Rees, S.</b>,
 <i class='BibTitle'>Testing matrix groups for primitivity</i>,
 <span class='BibJournal'>J. Algebra</span>,
 <em class='BibVolume'>184</em> (<span class='BibNumber'>3</span>)
 (<span class='BibYear'>1996</span>),
 <span class='BibPages'>795–817</span><br />
(<span class='BibNote'>https://doi.org/10.1006/jabr.1996.0285</span>).
</p>


<p><a id="biBHR94" name="biBHR94"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1279282">HR94</a></span>]   <b class='BibAuthor'>Holt, D. F. and Rees, S.</b>,
 <i class='BibTitle'>Testing modules for irreducibility</i>,
 <span class='BibJournal'>J. Austral. Math. Soc. Ser. A</span>,
 <em class='BibVolume'>57</em> (<span class='BibNumber'>1</span>)
 (<span class='BibYear'>1994</span>),
 <span class='BibPages'>1–16</span>.
</p>


<p><a id="biBIL00" name="biBIL00"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1795309">IL00</a></span>]   <b class='BibAuthor'>Ivanyos, G. and Lux, K.</b>,
 <i class='BibTitle'>Treating the exceptional cases of the MeatAxe</i>,
 <span class='BibJournal'>Experiment. Math.</span>,
 <em class='BibVolume'>9</em> (<span class='BibNumber'>3</span>)
 (<span class='BibYear'>2000</span>),
 <span class='BibPages'>373–381</span><br />
(<span class='BibNote'>http://projecteuclid.org/euclid.em/1045604672</span>).
</p>


<p><a id="biBJLNP13" name="biBJLNP13"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=3085037">JLNP13</a></span>]   <b class='BibAuthor'>Jambor, S., Leuner, M., Niemeyer, A. C. and Plesken, W.</b>,
 <i class='BibTitle'>Fast recognition of alternating groups of unknown degree</i>,
 <span class='BibJournal'>J. Algebra</span>,
 <em class='BibVolume'>392</em>
 (<span class='BibYear'>2013</span>),
 <span class='BibPages'>315–335</span><br />
(<span class='BibNote'>https://doi.org/10.1016/j.jalgebra.2013.06.005</span>).
</p>


<p><a id="biBKK15" name="biBKK15"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=3272372">KK15</a></span>]   <b class='BibAuthor'>Kantor, W. M. and Kassabov, M.</b>,
 <i class='BibTitle'>Black box groups isomorphic to \(\rm {PGL}(2,2^e)\)</i>,
 <span class='BibJournal'>J. Algebra</span>,
 <em class='BibVolume'>421</em>
 (<span class='BibYear'>2015</span>),
 <span class='BibPages'>16–26</span><br />
(<span class='BibNote'>https://doi.org/10.1016/j.jalgebra.2014.08.014</span>).
</p>


<p><a id="biBKM13" name="biBKM13"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=3066774">KM13</a></span>]   <b class='BibAuthor'>Kantor, W. M. and Magaard, K.</b>,
 <i class='BibTitle'>Black box exceptional groups of Lie type</i>,
 <span class='BibJournal'>Trans. Amer. Math. Soc.</span>,
 <em class='BibVolume'>365</em> (<span class='BibNumber'>9</span>)
 (<span class='BibYear'>2013</span>),
 <span class='BibPages'>4895–4931</span><br />
(<span class='BibNote'>https://doi.org/10.1090/S0002-9947-2013-05822-9</span>).
</p>


<p><a id="biBKM15" name="biBKM15"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=3272395">KM15</a></span>]   <b class='BibAuthor'>Kantor, W. M. and Magaard, K.</b>,
 <i class='BibTitle'>Black box exceptional groups of Lie type II</i>,
 <span class='BibJournal'>J. Algebra</span>,
 <em class='BibVolume'>421</em>
 (<span class='BibYear'>2015</span>),
 <span class='BibPages'>524–540</span><br />
(<span class='BibNote'>https://doi.org/10.1016/j.jalgebra.2014.09.003</span>).
</p>


<p><a id="biBKS09" name="biBKS09"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=2531224">KS09</a></span>]   <b class='BibAuthor'>Kantor, W. M. and Seress, Á.</b>,
 <i class='BibTitle'>Large element orders and the characteristic of Lie-type
              simple groups</i>,
 <span class='BibJournal'>J. Algebra</span>,
 <em class='BibVolume'>322</em> (<span class='BibNumber'>3</span>)
 (<span class='BibYear'>2009</span>),
 <span class='BibPages'>802–832</span><br />
(<span class='BibNote'>https://doi.org/10.1016/j.jalgebra.2009.05.004</span>).
</p>


<p><a id="biBLG01" name="biBLG01"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1829483">Lee01</a></span>]   <b class='BibAuthor'>Leedham-Green, C. R.</b>,
 <i class='BibTitle'>The computational matrix group project</i>,
  in  <i class='BibBooktitle'>Groups and computation, III (Columbus, OH,
      1999)</i>,
 <span class='BibPublisher'>de Gruyter, Berlin</span>,
 <span class='BibSeries'>Ohio State Univ. Math. Res. Inst. Publ.</span>,
 <em class='BibVolume'>8</em>
 (<span class='BibYear'>2001</span>),
 <span class='BibPages'>229–247</span>.
</p>


<p><a id="biBLMO07" name="biBLMO07"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=2356848">LMO07</a></span>]   <b class='BibAuthor'>Lübeck, F., Magaard, K. and O'Brien, E. A.</b>,
 <i class='BibTitle'>Constructive recognition of \({\rm SL}_3(q)\)</i>,
 <span class='BibJournal'>J. Algebra</span>,
 <em class='BibVolume'>316</em> (<span class='BibNumber'>2</span>)
 (<span class='BibYear'>2007</span>),
 <span class='BibPages'>619–633</span><br />
(<span class='BibNote'>https://doi.org/10.1016/j.jalgebra.2007.01.020</span>).
</p>


<p><a id="biBLNPS06" name="biBLNPS06"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=2221258">LNPS06</a></span>]   <b class='BibAuthor'>Law, M., Niemeyer, A. C., Praeger, C. E. and Seress, Á.</b>,
 <i class='BibTitle'>A reduction algorithm for large-base primitive permutation
              groups</i>,
 <span class='BibJournal'>LMS J. Comput. Math.</span>,
 <em class='BibVolume'>9</em>
 (<span class='BibYear'>2006</span>),
 <span class='BibPages'>159–173</span><br />
(<span class='BibNote'>https://doi.org/10.1112/S1461157000001236</span>).
</p>


<p><a id="biBLGO97a" name="biBLGO97a"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1470352">LO97a</a></span>]   <b class='BibAuthor'>Leedham-Green, C. R. and O'Brien, E. A.</b>,
 <i class='BibTitle'>Recognising tensor products of matrix groups</i>,
 <span class='BibJournal'>Internat. J. Algebra Comput.</span>,
 <em class='BibVolume'>7</em> (<span class='BibNumber'>5</span>)
 (<span class='BibYear'>1997</span>),
 <span class='BibPages'>541–559</span><br />
(<span class='BibNote'>https://doi.org/10.1142/S0218196797000241</span>).
</p>


<p><a id="biBLGO97b" name="biBLGO97b"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1438187">LO97b</a></span>]   <b class='BibAuthor'>Leedham-Green, C. R. and O'Brien, E. A.</b>,
 <i class='BibTitle'>Tensor products are projective geometries</i>,
 <span class='BibJournal'>J. Algebra</span>,
 <em class='BibVolume'>189</em> (<span class='BibNumber'>2</span>)
 (<span class='BibYear'>1997</span>),
 <span class='BibPages'>514–528</span><br />
(<span class='BibNote'>https://doi.org/10.1006/jabr.1996.6881</span>).
</p>


<p><a id="biBLGO02" name="biBLGO02"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1925006">LO02</a></span>]   <b class='BibAuthor'>Leedham-Green, C. R. and O'Brien, E. A.</b>,
 <i class='BibTitle'>Recognising tensor-induced matrix groups</i>,
 <span class='BibJournal'>J. Algebra</span>,
 <em class='BibVolume'>253</em> (<span class='BibNumber'>1</span>)
 (<span class='BibYear'>2002</span>),
 <span class='BibPages'>14–30</span><br />
(<span class='BibNote'>https://doi.org/10.1016/S0021-8693(02)00041-8</span>).
</p>


<p><a id="biBLO07" name="biBLO07"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=2352733">LO07</a></span>]   <b class='BibAuthor'>Liebeck, M. W. and O'Brien, E. A.</b>,
 <i class='BibTitle'>Finding the characteristic of a group of Lie type</i>,
 <span class='BibJournal'>J. Lond. Math. Soc. (2)</span>,
 <em class='BibVolume'>75</em> (<span class='BibNumber'>3</span>)
 (<span class='BibYear'>2007</span>),
 <span class='BibPages'>741–754</span><br />
(<span class='BibNote'>https://doi.org/10.1112/jlms/jdm028</span>).
</p>


<p><a id="biBLGO09" name="biBLGO09"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=2531225">LO09</a></span>]   <b class='BibAuthor'>Leedham-Green, C. R. and O'Brien, E. A.</b>,
 <i class='BibTitle'>Constructive recognition of classical groups in odd
              characteristic</i>,
 <span class='BibJournal'>J. Algebra</span>,
 <em class='BibVolume'>322</em> (<span class='BibNumber'>3</span>)
 (<span class='BibYear'>2009</span>),
 <span class='BibPages'>833–881</span><br />
(<span class='BibNote'>https://doi.org/10.1016/j.jalgebra.2009.04.028</span>).
</p>


<p><a id="biBLO16" name="biBLO16"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=3461031">LO16</a></span>]   <b class='BibAuthor'>Liebeck, M. W. and O'Brien, E. A.</b>,
 <i class='BibTitle'>Recognition of finite exceptional groups of Lie type</i>,
 <span class='BibJournal'>Trans. Amer. Math. Soc.</span>,
 <em class='BibVolume'>368</em> (<span class='BibNumber'>9</span>)
 (<span class='BibYear'>2016</span>),
 <span class='BibPages'>6189–6226</span><br />
(<span class='BibNote'>https://doi.org/10.1090/tran/6534</span>).
</p>


<p><a id="biBNeu09" name="biBNeu09"></a></p>
<p class='BibEntry'>
[<span class='BibKey'>Neu09</span>]   <b class='BibAuthor'>Neunhöffer, M.</b>,
 <i class='BibTitle'>Constructive Recognition of Finite Groups</i>,
 <span class='BibType'>Habilitation thesis</span>,
 <span class='BibSchool'>RWTH Aachen</span>
 (<span class='BibYear'>2009</span>)<br />
(<span class='BibNote'>https://github.com/neunhoef/habil</span>).
</p>


<p><a id="biBNie05" name="biBNie05"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=2142090">Nie05</a></span>]   <b class='BibAuthor'>Niemeyer, A. C.</b>,
 <i class='BibTitle'>Constructive recognition of normalizers of small extra-special
              matrix groups</i>,
 <span class='BibJournal'>Internat. J. Algebra Comput.</span>,
 <em class='BibVolume'>15</em> (<span class='BibNumber'>2</span>)
 (<span class='BibYear'>2005</span>),
 <span class='BibPages'>367–394</span><br />
(<span class='BibNote'>https://doi.org/10.1142/S021819670500230X</span>).
</p>


<p><a id="biBNP92" name="biBNP92"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1182102">NP92</a></span>]   <b class='BibAuthor'>Neumann, P. M. and Praeger, C. E.</b>,
 <i class='BibTitle'>A recognition algorithm for special linear groups</i>,
 <span class='BibJournal'>Proc. London Math. Soc. (3)</span>,
 <em class='BibVolume'>65</em> (<span class='BibNumber'>3</span>)
 (<span class='BibYear'>1992</span>),
 <span class='BibPages'>555–603</span><br />
(<span class='BibNote'>https://doi.org/10.1112/plms/s3-65.3.555</span>).
</p>


<p><a id="biBNP97" name="biBNP97"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1444141">NP97</a></span>]   <b class='BibAuthor'>Niemeyer, A. C. and Praeger, C. E.</b>,
 <i class='BibTitle'>Implementing a recognition algorithm for classical groups</i>,
  in  <i class='BibBooktitle'>Groups and computation, II (New Brunswick,
      NJ, 1995)</i>,
 <span class='BibPublisher'>Amer. Math. Soc., Providence, RI</span>,
 <span class='BibSeries'>DIMACS Ser. Discrete Math. Theoret. Comput. Sci.</span>,
 <em class='BibVolume'>28</em>
 (<span class='BibYear'>1997</span>),
 <span class='BibPages'>273–296</span>.
</p>


<p><a id="biBNP98" name="biBNP98"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1625479">NP98</a></span>]   <b class='BibAuthor'>Niemeyer, A. C. and Praeger, C. E.</b>,
 <i class='BibTitle'>A recognition algorithm for classical groups over finite
              fields</i>,
 <span class='BibJournal'>Proc. London Math. Soc. (3)</span>,
 <em class='BibVolume'>77</em> (<span class='BibNumber'>1</span>)
 (<span class='BibYear'>1998</span>),
 <span class='BibPages'>117–169</span><br />
(<span class='BibNote'>https://doi.org/10.1112/S0024611598000422</span>).
</p>


<p><a id="biBNP99" name="biBNP99"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1717416">NP99</a></span>]   <b class='BibAuthor'>Niemeyer, A. C. and Praeger, C. E.</b>,
 <i class='BibTitle'>A recognition algorithm for non-generic classical groups over
              finite fields</i>,
 <span class='BibJournal'>J. Austral. Math. Soc. Ser. A</span>,
 <em class='BibVolume'>67</em> (<span class='BibNumber'>2</span>)
 (<span class='BibYear'>1999</span>),
 <span class='BibPages'>223–253</span>.
</p>


<p><a id="biBNS06" name="biBNS06"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=MR2289128">NS06</a></span>]   <b class='BibAuthor'>Neunhöffer, M. and Seress, Á.</b>,
 <i class='BibTitle'>A data structure for a uniform approach to computations with
              finite groups</i>,
  in  <i class='BibBooktitle'>ISSAC 2006</i>,
 <span class='BibPublisher'>ACM</span>,
 <span class='BibAddress'>New York</span>
 (<span class='BibYear'>2006</span>),
 <span class='BibPages'>254–261</span><br />
(<span class='BibNote'>https://doi.org/10.1145/1145768.1145811</span>).
</p>


<p><a id="biBO'B06" name="biBO'B06"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=2258009">O'B06</a></span>]   <b class='BibAuthor'>O'Brien, E. A.</b>,
 <i class='BibTitle'>Towards effective algorithms for linear groups</i>,
  in  <i class='BibBooktitle'>Finite geometries, groups, and computation</i>,
 <span class='BibPublisher'>Walter de Gruyter, Berlin</span>
 (<span class='BibYear'>2006</span>),
 <span class='BibPages'>163–190</span>.
</p>


<p><a id="biBO'B11" name="biBO'B11"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=2858866">O'B11</a></span>]   <b class='BibAuthor'>O'Brien, E. A.</b>,
 <i class='BibTitle'>Algorithms for matrix groups</i>,
  in  <i class='BibBooktitle'>Groups St Andrews 2009 in Bath.
      Volume 2</i>,
 <span class='BibPublisher'>Cambridge Univ. Press, Cambridge</span>,
 <span class='BibSeries'>London Math. Soc. Lecture Note Ser.</span>,
 <em class='BibVolume'>388</em>
 (<span class='BibYear'>2011</span>),
 <span class='BibPages'>297–323</span>.
</p>


<p><a id="biBPak00" name="biBPak00"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1931844">Pak00</a></span>]   <b class='BibAuthor'>Pak, I.</b>,
 <i class='BibTitle'>The product replacement algorithm is polynomial</i>,
  in  <i class='BibBooktitle'>41st Annual Symposium on Foundations of
      Computer
  Science (Redondo Beach, CA, 2000)</i>,
 <span class='BibPublisher'>IEEE Comput. Soc. Press, Los Alamitos, CA</span>
 (<span class='BibYear'>2000</span>),
 <span class='BibPages'>476–485</span><br />
(<span class='BibNote'>https://doi.org/10.1109/SFCS.2000.892135</span>).
</p>


<p><a id="biBPar84" name="biBPar84"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=760660">Par84</a></span>]   <b class='BibAuthor'>Parker, R. A.</b>,
 <i class='BibTitle'>The computer calculation of modular characters (the meat-axe)</i>,
  in  <i class='BibBooktitle'>Computational group theory (Durham, 1982)</i>,
 <span class='BibPublisher'>Academic Press, London</span>
 (<span class='BibYear'>1984</span>),
 <span class='BibPages'>267–274</span>.
</p>


<p><a id="biBPra99" name="biBPra99"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1676657">Pra99</a></span>]   <b class='BibAuthor'>Praeger, C. E.</b>,
 <i class='BibTitle'>Primitive prime divisor elements in finite classical groups</i>,
  in  <i class='BibBooktitle'>Groups St. Andrews 1997 in Bath,
      II</i>,
 <span class='BibPublisher'>Cambridge Univ. Press, Cambridge</span>,
 <span class='BibSeries'>London Math. Soc. Lecture Note Ser.</span>,
 <em class='BibVolume'>261</em>
 (<span class='BibYear'>1999</span>),
 <span class='BibPages'>605–623</span><br />
(<span class='BibNote'>https://doi.org/10.1017/CBO9780511666148.024</span>).
</p>


<p><a id="biBSer03" name="biBSer03"></a></p>
<p class='BibEntry'>
[<span class='BibKeyLink'><a href="https://www.ams.org/mathscinet-getitem?mr=1970241">Ser03</a></span>]   <b class='BibAuthor'>Seress, Á.</b>,
 <i class='BibTitle'>Permutation group algorithms</i>,
 <span class='BibPublisher'>Cambridge University Press, Cambridge</span>,
 <span class='BibSeries'>Cambridge Tracts in Mathematics</span>,
 <em class='BibVolume'>152</em>
 (<span class='BibYear'>2003</span>),
 <span class='BibPages'>x+264 pages</span><br />
(<span class='BibNote'>https://doi.org/10.1017/CBO9780511546549</span>).
</p>

<p> </p>


<div class="chlinkprevnextbot"> <a href="chap0_mj.html">[Top of Book]</a>   <a href="chap0_mj.html#contents">[Contents]</a>    <a href="chap9_mj.html">[Previous Chapter]</a>    <a href="chapInd_mj.html">[Next Chapter]</a>   </div>


<div class="chlinkbot"><span class="chlink1">Goto Chapter: </span><a href="chap0_mj.html">Top</a>  <a href="chap1_mj.html">1</a>  <a href="chap2_mj.html">2</a>  <a href="chap3_mj.html">3</a>  <a href="chap4_mj.html">4</a>  <a href="chap5_mj.html">5</a>  <a href="chap6_mj.html">6</a>  <a href="chap7_mj.html">7</a>  <a href="chap8_mj.html">8</a>  <a href="chap9_mj.html">9</a>  <a href="chapBib_mj.html">Bib</a>  <a href="chapInd_mj.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>

[Verzeichnis aufwärts0.610unsichere Verbindung]

                                                                                                                                                                                                                                                                                                                                                                                                     


Neuigkeiten

     Aktuelles
     Motto des Tages

Open Source Software

     Quellcodebibliothek
     Eigene Quellcodes
     Fremde Quellcodes
     Suchen

Jenseits des Üblichen ....
    

Besucherstatistik

Besucherstatistik

Statistik
#Sources=1104850
#Domains=416997