{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T08:16:27Z","timestamp":1772439387665,"version":"3.50.1"},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,2,1]],"date-time":"2003-02-01T00:00:00Z","timestamp":1044057600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3855,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[2003,2]]},"DOI":"10.1016\/s0747-7171(02)00132-3","type":"journal-article","created":{"date-parts":[[2003,2,12]],"date-time":"2003-02-12T07:46:23Z","timestamp":1045035983000},"page":"195-239","source":"Crossref","is-referenced-by-count":15,"title":["Constructive recognition of classical groups in their natural representation"],"prefix":"10.1016","volume":"35","author":[{"given":"Peter A.","family":"Brooksbank","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(02)00132-3_B1","doi-asserted-by":"crossref","unstructured":"Babai, L., 1991. Local expansion of vertex-transitive graphs and random generation in finite groups. Proceedings of the ACM Symposium on Theory of Computing. pp. 164\u2013174","DOI":"10.1145\/103418.103440"},{"key":"10.1016\/S0747-7171(02)00132-3_B2","doi-asserted-by":"crossref","unstructured":"Brooksbank, P., 2001a. A constructive recognition algorithm for the matrix group \u03a9(d,q). In: Kantor, W.M., Seress, \u00c1. (Eds.), Groups and Computation III, vol. 8. Ohio State University Math. Res. Inst. Publ., Walter de Gruyter, Berlin, New York","DOI":"10.1515\/9783110872743.79"},{"key":"10.1016\/S0747-7171(02)00132-3_B3","unstructured":"Brooksbank, P., 2001b. Constructive recognition of the finite simple classical groups. Ph. D. Thesis, U. Oregon"},{"key":"10.1016\/S0747-7171(02)00132-3_B4","unstructured":"Celler, F., 1997. Matrixgruppenalgorithmen in GAP. Ph. D. Thesis, RWTH Aachen"},{"key":"10.1016\/S0747-7171(02)00132-3_B5","doi-asserted-by":"crossref","unstructured":"Celler, F., Leedham-Green, C.R., 1998. A constructive recognition algorithm for the special linear group. The Atlas of Finite Groups: Ten Years On (Birmingham 1995), London Mathematic Society Lecture Note Series, vol. 249","DOI":"10.1017\/CBO9780511565830.007"},{"key":"10.1016\/S0747-7171(02)00132-3_B6","doi-asserted-by":"crossref","first-page":"4931","DOI":"10.1080\/00927879508825509","article-title":"Generating random elements of a finite group","volume":"23","author":"Celler","year":"1995","journal-title":"Commun. Algebra"},{"key":"10.1016\/S0747-7171(02)00132-3_B7","doi-asserted-by":"crossref","unstructured":"Conder, M., Leedham-Green, C.R., 2001. Fast recognition of classical groups over large fields. In: Kantor, W.M., Seress, \u00c1. (Eds.), Groups and Computation III, vol. 8. Ohio State University Math. Res. Inst. Publ., Walter de Gruyter, Berlin, New York","DOI":"10.1515\/9783110872743.113"},{"key":"10.1016\/S0747-7171(02)00132-3_B8","unstructured":"Conder, M., Leedham-Green, C.R., O\u2019Brien, E.A., 2002. Constructive recognition of SL(2, q) (in preparation)"},{"key":"10.1016\/S0747-7171(02)00132-3_B9","unstructured":"The GAP Group, 2000. Groups, Algorithms, and Programming, Version 4.2; Aachen, St Andrews. Available from: http:\/\/www-gap.dcs.st-and.ac.uk\/gap"},{"key":"10.1016\/S0747-7171(02)00132-3_B10","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1006\/jabr.1996.0285","article-title":"Computing matrix group decompositions with respect to a normal subgroup","volume":"184","author":"Holt","year":"1996","journal-title":"J. Algebra"},{"key":"10.1016\/S0747-7171(02)00132-3_B11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S1446788700036016","article-title":"Testing modules for irreducibility","volume":"57","author":"Holt","year":"1994","journal-title":"J. Aust. Math. Soc. (Ser. A)"},{"key":"10.1016\/S0747-7171(02)00132-3_B12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0002-9947-1982-0648077-6","article-title":"The rank 3 permutation representations of the finite classical groups","volume":"271","author":"Kantor","year":"1982","journal-title":"TAMS"},{"issue":"708","key":"10.1016\/S0747-7171(02)00132-3_B13","article-title":"Black box classical groups","volume":"149","author":"Kantor","year":"2001","journal-title":"Mem. Amer. Math. Soc."},{"key":"10.1016\/S0747-7171(02)00132-3_B14","series-title":"The Subgroup Structure of the Finite Classical Groups","volume":"vol. 129","author":"Kleidman","year":"1990"},{"key":"10.1016\/S0747-7171(02)00132-3_B15","doi-asserted-by":"crossref","unstructured":"Leedham-Green, C.R., 2001. The computational matrix group project. In: Kantor, W.M., Seress, \u00c1. (Eds.), Groups and Computation III, vol. 8. Ohio State University Math. Res. Inst. Publ., Walter de Gruyter, Berlin, New York","DOI":"10.1515\/9783110872743.229"},{"key":"10.1016\/S0747-7171(02)00132-3_B16","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1142\/S0218196797000241","article-title":"Recognising tensor products of matrix groups","volume":"7","author":"Leedham-Green","year":"1997","journal-title":"Int. J. Algebra Comput."},{"key":"10.1016\/S0747-7171(02)00132-3_B17","volume":"vol. 20","author":"Lidl","year":"1983"},{"key":"10.1016\/S0747-7171(02)00132-3_B18","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1112\/plms\/s3-65.3.555","article-title":"A recognition algorithm for special linear groups","volume":"65","author":"Neumann","year":"1992","journal-title":"Proc. London Math. Soc. (3)"},{"key":"10.1016\/S0747-7171(02)00132-3_B19","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1112\/S0024611598000422","article-title":"A recognition algorithm for classical groups over finite fields","volume":"77","author":"Niemeyer","year":"1998","journal-title":"Proc. London Math. Soc. (1)"},{"key":"10.1016\/S0747-7171(02)00132-3_B20","doi-asserted-by":"crossref","unstructured":"Seress, \u00c1., 2002. Permutation Group Algorithms, Cambridge University Press (to appear)","DOI":"10.1017\/CBO9780511546549"},{"key":"10.1016\/S0747-7171(02)00132-3_B21","series-title":"The geometry of the classical groups","author":"Taylor","year":"1992"},{"key":"10.1016\/S0747-7171(02)00132-3_B22","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01692444","article-title":"Zur theorie der potenzreste","volume":"3","author":"Zsigmondy","year":"1892","journal-title":"Monatsh. Math., Phys."}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717102001323?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717102001323?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T01:44:17Z","timestamp":1704764657000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717102001323"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,2]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,2]]}},"alternative-id":["S0747717102001323"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(02)00132-3","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[2003,2]]}}}