11
Views
5
CrossRef citations to date
0
Altmetric
Original Articles

An Implementation of the Neumann–Praeger Algorithm for the Recognition of Special Linear Groups

&
Pages 237-242 | Published online: 03 Apr 2012

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (1)

Frank Celler, Charles R. Leedham-Green, Scott H. Murray, Alice C. Niemeyer & E.A. O'brien. (1995) Generating random elements of a finite group. Communications in Algebra 23:13, pages 4931-4948.
Read now

Articles from other publishers (4)

Yuval Peres, Ryokichi Tanaka & Alex Zhai. (2020) Cutoff for product replacement on finite groups. Probability Theory and Related Fields 177:3-4, pages 823-853.
Crossref
Julius Whiston. (2000) Maximal Independent Generating Sets of the Symmetric Group. Journal of Algebra 232:1, pages 255-268.
Crossref
I. Pak. (2000) The product replacement algorithm is polynomial. The product replacement algorithm is polynomial.
Derek F. Holt & Sarah Rees. (2009) Testing modules for irreducibility. Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics 57:1, pages 1-16.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.