{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T08:16:31Z","timestamp":1772439391758,"version":"3.50.1"},"reference-count":20,"publisher":"Wiley","license":[{"start":{"date-parts":[[2010,2,1]],"date-time":"2010-02-01T00:00:00Z","timestamp":1264982400000},"content-version":"unspecified","delay-in-days":2588,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["LMS J. Comput. Math."],"published-print":{"date-parts":[[2003]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper, the author presents a new algorithm to recognise, constructively, when a given black-box group is a homomorphic image of the unitary group SU(<jats:italic>d, q<\/jats:italic>) for known<jats:italic>d<\/jats:italic>and<jats:italic>q<\/jats:italic>. The algorithm runs in polynomial time, assuming the existence of oracles for handling SL(2,<jats:italic>q<\/jats:italic>) subgroups, and for computing discrete logarithms in cyclic groups of order<jats:italic>q<\/jats:italic>\u00b1 1.<\/jats:p>","DOI":"10.1112\/s1461157000000437","type":"journal-article","created":{"date-parts":[[2013,8,6]],"date-time":"2013-08-06T11:41:45Z","timestamp":1375789305000},"page":"162-197","source":"Crossref","is-referenced-by-count":15,"title":["Fast Constructive Recognition of Black-Box Unitary Groups"],"prefix":"10.1112","volume":"6","author":[{"given":"Peter A.","family":"Brooksbank","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2010,2,1]]},"reference":[{"key":"S1461157000000437_ref006","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(02)00132-3"},{"key":"S1461157000000437_ref020","doi-asserted-by":"publisher","DOI":"10.1007\/BF01692444"},{"key":"S1461157000000437_ref015","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511629235"},{"key":"S1461157000000437_ref013","article-title":"Black box classical groups","volume":"149","author":"Kantor","year":"2001","journal-title":"Mem. Amer. Math. Soc."},{"key":"S1461157000000437_ref003","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107360228.004"},{"key":"S1461157000000437_ref018","doi-asserted-by":"publisher","DOI":"10.1112\/S0024611598000422"},{"key":"S1461157000000437_ref010","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/028\/07"},{"key":"S1461157000000437_ref005","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-03-03040-X"},{"key":"S1461157000000437_ref011","unstructured":"11 The GAP Group, \u2018Groups, algorithms, and programming\u2019, Version 4.2 (The GAP Group, Aachen, St Andrews); http:\/\/www-gap.dcs.st-and.ac.uk\/gap."},{"key":"S1461157000000437_ref002","first-page":"164","article-title":"Local expansion of vertex-transitive graphs and random generation in finite groups","author":"Babai","year":"1991","journal-title":"Proc. ACM Symp. on Theory of Computing"},{"key":"S1461157000000437_ref007","unstructured":"7 Brooksbank P.A. , \u2018Constructive recognition of the finite simple classical groups\u2019, Ph. D. thesis, Univeristy of Oregon, 2001."},{"key":"S1461157000000437_ref001","doi-asserted-by":"publisher","DOI":"10.1007\/BF01388470"},{"key":"S1461157000000437_ref016","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1515\/9783110872743.229","volume-title":"Groups and computation III","volume":"8","author":"Leedham-Green","year":"2001"},{"key":"S1461157000000437_ref012","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":"Trans. Amer. Math. Soc."},{"key":"S1461157000000437_ref008","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1515\/9783110872743.95","volume-title":"Groups and Computation III","volume":"8","author":"Brooksbank","year":"2001"},{"key":"S1461157000000437_ref014","volume-title":"Groups, combinatorics and geometry","author":"Kantor","year":"2003"},{"key":"S1461157000000437_ref004","first-page":"427","article-title":"Las Vegas algorithms for matrix groups","author":"Beals","year":"1993","journal-title":"Proc. IEEE Symp. Found. Comp. Sci."},{"key":"S1461157000000437_ref009","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1515\/9783110872743.113","volume-title":"Groups and computation III","volume":"8","author":"Conder","year":"2001"},{"key":"S1461157000000437_ref017","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s3-65.3.555"},{"key":"S1461157000000437_ref019","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546549"}],"container-title":["LMS Journal of Computation and Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1461157000000437","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,3]],"date-time":"2023-07-03T18:17:33Z","timestamp":1688408253000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1461157000000437\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"references-count":20,"alternative-id":["S1461157000000437"],"URL":"https:\/\/doi.org\/10.1112\/s1461157000000437","relation":{},"ISSN":["1461-1570"],"issn-type":[{"value":"1461-1570","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}