{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T11:20:12Z","timestamp":1770895212917,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2009,5,31]],"date-time":"2009-05-31T00:00:00Z","timestamp":1243728000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2009,5,31]]},"DOI":"10.1145\/1536414.1536425","type":"proceedings-article","created":{"date-parts":[[2009,6,2]],"date-time":"2009-06-02T14:51:13Z","timestamp":1243954273000},"page":"55-64","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Polynomial-time theory of matrix groups"],"prefix":"10.1145","author":[{"given":"L\u00e1szl\u00f3","family":"Babai","sequence":"first","affiliation":[{"name":"University of Chicago, Chicago, IL, USA"}]},{"given":"Robert","family":"Beals","sequence":"additional","affiliation":[{"name":"IDA-CCR Princeton, Princeton, NJ, USA"}]},{"given":"\u00c1kos","family":"Seress","sequence":"additional","affiliation":[{"name":"Ohio State University, Columbus, OH, USA"}]}],"member":"320","published-online":{"date-parts":[[2009,5,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2007.v003a007"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1515\/9783110872743.1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22192"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103440"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107360228.004"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1024"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1006\/jabr.1996.6980"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1515\/jgth.2002.010"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1112\/S1461157000000036"},{"key":"e_1_3_2_1_11_1","first-page":"39","article-title":"Recognizing simplicity of black-box groups and the frequency of p-singular elements in affine groups","author":"Babai L.","year":"2001","unstructured":"L. Babai and A. Shalev . Recognizing simplicity of black-box groups and the frequency of p-singular elements in affine groups . In Groups and Comp. III , pp. 39 -- 62 . deGruyter, 2001 . L. Babai and A. Shalev. Recognizing simplicity of black-box groups and the frequency of p-singular elements in affine groups. In Groups and Comp. III, pp. 39--62. deGruyter, 2001.","journal-title":"Groups and Comp. III"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1984.715919"},{"key":"e_1_3_2_1_13_1","volume-title":"Algorithmic Number Theory I: Efficient Algorithms","author":"Bach E.","year":"1996","unstructured":"E. Bach and J. O. Shallit . Algorithmic Number Theory I: Efficient Algorithms . MIT Press , 1996 . E. Bach and J. O. Shallit. Algorithmic Number Theory I: Efficient Algorithms. MIT Press, 1996."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/028\/03"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1993.366844"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-03-03040-X"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s000130050437"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1112\/S1461157000000437"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2008.03.021"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1515\/9783110872743.95","article-title":"On constructive recognition of a black box PSL(d, q)","author":"Brooksbank P. A.","year":"2001","unstructured":"P. A. Brooksbank and W. M. Kantor . On constructive recognition of a black box PSL(d, q) . In Groups and Computation III , pp. 95 -- 111 . deGruyter, 2001 . P. A. Brooksbank and W. M. Kantor. On constructive recognition of a black box PSL(d, q). In Groups and Computation III, pp. 95--111. deGruyter, 2001.","journal-title":"Groups and Computation III"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2006.02.024"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1080\/00927879508825509"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-05-03756-6"},{"key":"e_1_3_2_1_24_1","volume-title":"A","author":"Conway J. H.","year":"1985","unstructured":"J. H. Conway , R. T. Curtis , S. P. Norton , R. A. Parker , R. A . Wilson : ATLAS of Finite Groups. Clarendon Press , Oxford, 1985 . J. H. Conway, R. T. Curtis, S. P. Norton, R. A. Parker, R. A. Wilson: ATLAS of Finite Groups. Clarendon Press, Oxford, 1985."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","first-page":"R94","DOI":"10.37236\/818","article-title":"Generating random elements in finite groups","volume":"15","author":"Dixon J. D.","year":"2008","unstructured":"J. D. Dixon . Generating random elements in finite groups . Electronic J. Combinatorics , 15\/1 : R94 , 2008 . J. D. Dixon. Generating random elements in finite groups. Electronic J. Combinatorics, 15\/1:R94, 2008.","journal-title":"Electronic J. Combinatorics"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1978-092-5"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1980.34"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-006-0023-0"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1515\/jgt.2008.047"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1446788700036016"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1006\/jabr.2001.8943"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1080\/10586458.2000.10504414"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90052-2"},{"key":"e_1_3_2_1_34_1","volume-title":"Nr. 708:viii+168 pp.","author":"Kantor W. M.","year":"2001","unstructured":"W. M. Kantor and A. Seress . Black box classical groups. Mem. AMS, 149 , Nr. 708:viii+168 pp. , 2001 . W. M. Kantor and A. Seress. Black box classical groups. Mem. AMS, 149, Nr. 708:viii+168 pp., 2001."},{"key":"e_1_3_2_1_35_1","first-page":"123","volume-title":"Groups, Combinatorics, and Geometry (Durham","author":"Kantor W. M.","year":"2001","unstructured":"W. M. Kantor and A. Seress . Computing with matrix groups . In Groups, Combinatorics, and Geometry (Durham 2001 ), pp. 123 -- 137 . World Scientific , 2003. W. M. Kantor and A. Seress. Computing with matrix groups. In Groups, Combinatorics, and Geometry (Durham 2001), pp. 123--137. World Scientific, 2003."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01375471"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1016\/0021-8693(74)90150-1"},{"key":"e_1_3_2_1_38_1","volume-title":"Lectures on polynomial-time computation in groups. Northeastern U. TR NU-CCS-90-16","author":"Luks E. M.","year":"1990","unstructured":"E. M. Luks . Lectures on polynomial-time computation in groups. Northeastern U. TR NU-CCS-90-16 , 1990 . E. M. Luks. Lectures on polynomial-time computation in groups. Northeastern U. TR NU-CCS-90-16, 1990."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579204"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267813"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1090\/dimacs\/011\/11","volume-title":"Groups and Computation","author":"Luks E. M.","year":"1993","unstructured":"E. M. Luks . Permutation groups and polynomial-time computation . In Groups and Computation , pp. 139 -- 175 . DIMACS , 1993 . E. M. Luks. Permutation groups and polynomial-time computation. In Groups and Computation, pp. 139--175. DIMACS, 1993."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/028\/12"},{"key":"e_1_3_2_1_43_1","volume-title":"Manuscript","author":"Parker C. W.","year":"2004","unstructured":"C. W. Parker and R. A. Wilson . Recognising simplicity of black-box groups . Manuscript , 2004 . C. W. Parker and R. A. Wilson. Recognising simplicity of black-box groups. Manuscript, 2004."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(08)80017-X"},{"key":"e_1_3_2_1_45_1","volume-title":"An Introduction to the Theory of Groups","author":"Rotman J.","year":"1994","unstructured":"J. Rotman . An Introduction to the Theory of Groups . Springer , 1994 . J. Rotman. An Introduction to the Theory of Groups. Springer, 1994."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1006\/jabr.1993.1132"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546549"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_3_2_1_49_1","first-page":"169","volume-title":"Computational problems in abstract algebra (Oxford","author":"Sims C. C.","year":"1967","unstructured":"C. C. Sims . Computational methods in the study of permutation groups . In Computational problems in abstract algebra (Oxford , 1967 ), pp. 169 -- 183 . Pergamon Press , 1970. C. C. Sims. Computational methods in the study of permutation groups. In Computational problems in abstract algebra (Oxford, 1967), pp. 169--183. Pergamon Press, 1970."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/800204.806264"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.2307\/1970423"}],"event":{"name":"STOC '09: Symposium on Theory of Computing","location":"Bethesda MD USA","acronym":"STOC '09","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-first annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536425","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1536414.1536425","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:26:08Z","timestamp":1750278368000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1536414.1536425"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,31]]},"references-count":50,"alternative-id":["10.1145\/1536414.1536425","10.1145\/1536414"],"URL":"https:\/\/doi.org\/10.1145\/1536414.1536425","relation":{},"subject":[],"published":{"date-parts":[[2009,5,31]]},"assertion":[{"value":"2009-05-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}