{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T19:20:44Z","timestamp":1772565644758,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642315930","type":"print"},{"value":"9783642315947","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31594-7_5","type":"book-chapter","created":{"date-parts":[[2012,6,22]],"date-time":"2012-06-22T21:20:21Z","timestamp":1340400021000},"page":"51-62","source":"Crossref","is-referenced-by-count":16,"title":["Polynomial-Time Isomorphism Test for Groups with No Abelian Normal Subgroups"],"prefix":"10.1007","author":[{"given":"L\u00e1szl\u00f3","family":"Babai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Codenotti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youming","family":"Qiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"5_CR1","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/0021-8693(84)90183-2","volume":"90","author":"M. Aschbacher","year":"1984","unstructured":"Aschbacher, M., Guralnick, R.: Some applications of the first cohomology group. J. Algebra\u00a090(2), 446\u2013460 (1984)","journal-title":"J. Algebra"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Babai, L., Beals, R.: A polynomial-time theory of black-box groups I. In: Groups St Andrews 1997 in Bath. LMS Lect. Notes, vol.\u00a0260, pp. 30\u201364. Cambr. U. Press (1999)","DOI":"10.1017\/CBO9781107360228.004"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Babai, L., Codenotti, P., Grochow, J.A., Qiao, Y.M.: Code equivalence and group isomorphism. In: Proc. 22nd SODA, pp. 1395\u20131408 (2011)","DOI":"10.1137\/1.9781611973082.107"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Babai, L., Qiao, Y.M.: Polynomial-time isomorphism test for groups with abelian Sylow towers. In: 29th STACS, pp. 453\u2013464 (2012)","DOI":"10.1007\/978-3-642-31594-7_5"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1112\/blms\/13.1.1","volume":"13","author":"P.J. Cameron","year":"1981","unstructured":"Cameron, P.J.: Finite permutation groups and finite simple groups. Bull. London Math. Soc.\u00a013(1), 1\u201322 (1981)","journal-title":"Bull. London Math. Soc."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0747-7171(02)00133-5","volume":"35","author":"J.J. Cannon","year":"2003","unstructured":"Cannon, J.J., Holt, D.F.: Automorphism group computation and isomorphism testing in finite groups. J. Symb. Comput.\u00a035, 241\u2013267 (2003)","journal-title":"J. Symb. Comput."},{"key":"5_CR7","unstructured":"Felsch, V., Neub\u00fcser, J.: On a programme for the determination of the automorphism group of a finite group. In: Proc. Conf. on Computational Problems in Algebra, Oxford, 1967, pp. 59\u201360. Pergamon Press (1970)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Furst, M.L., Hopcroft, J., Luks, E.M.: Polynomial-time algorithms for permutation groups. In: Proc. 21st FOCS, pp. 36\u201341. IEEE Comp. Soc. (1980)","DOI":"10.1109\/SFCS.1980.34"},{"issue":"6","key":"5_CR9","doi-asserted-by":"publisher","first-page":"986","DOI":"10.1016\/j.jcss.2007.03.013","volume":"73","author":"T. Kavitha","year":"2007","unstructured":"Kavitha, T.: Linear time algorithms for abelian group isomorphism and related problems. J. Comput. Syst. Sci.\u00a073(6), 986\u2013996 (2007)","journal-title":"J. Comput. Syst. Sci."},{"key":"5_CR10","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF01375471","volume":"11","author":"D.E. Knuth","year":"1991","unstructured":"Knuth, D.E.: Efficient representation of perm groups. Combinat.\u00a011, 57\u201368 (1991)","journal-title":"Combinat."},{"key":"5_CR11","unstructured":"Le Gall, F.: Efficient isomorphism testing for a class of group extensions. In: 26th STACS, pp. 625\u2013636 (2009)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Luks, E.M.: Hypergraph isomorphism and structural equivalence of boolean functions. In: Proc. 31st ACM STOC, pp. 652\u2013658. ACM Press (1999)","DOI":"10.1145\/301250.301427"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Luks, E.M., Miyazaki, T.: Polynomial-time normalizers for permutation groups with restricted composition factors. In: 13th ISAAC, pp. 176\u2013183 (2002)","DOI":"10.1145\/780506.780529"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Luks, E.M., Seress, \u00c1.: Computing the Fitting subgroup and solvable radical for small-base permutation groups in nearly linear time. In: Workshop on Groups and Computation II, DIMACS Series in DMTCS, pp. 169\u2013181 (1991)","DOI":"10.1090\/dimacs\/028\/12"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Miller, G.L.: On the n logn isomorphism technique. In: 10th STOC, pp. 51\u201358 (1978)","DOI":"10.1145\/800133.804331"},{"key":"5_CR16","unstructured":"Qiao, Y.M., Sarma, J.M.N., Tang, B.: On isomorphism testing of groups with normal Hall subgroups. In: Proc. 28th STACS, pp. 567\u2013578 (2011)"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Robinson, D.J.S.: A Course in the Theory of Groups, 2nd edn. Springer (1996)","DOI":"10.1007\/978-1-4419-8594-1"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Seress, \u00c1.: Permutation Group Algorithms. Cambridge Univ. Press (2003)","DOI":"10.1017\/CBO9780511546549"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Sims, C.C.: Computation with permutation groups. In: Petrick, S.R. (ed.) Proc.\u00a02nd Symp. Symb. Algeb. Manip., pp. 23\u201328. ACM Press (1971)","DOI":"10.1145\/800204.806264"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"277","DOI":"10.4153\/CJM-1962-018-0","volume":"14","author":"R. Steinberg","year":"1962","unstructured":"Steinberg, R.: Generators for simple groups. Canad. J. Math.\u00a014, 277\u2013283 (1962)","journal-title":"Canad. J. Math."},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Suzuki, M.: Group Theory II. Springer (1986)","DOI":"10.1007\/978-3-642-86885-6"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"2642","DOI":"10.1016\/j.jalgebra.2009.07.029","volume":"322","author":"J.B. Wilson","year":"2009","unstructured":"Wilson, J.B.: Decomposing p-groups via Jordan algebras. J. Algebra\u00a0322, 2642\u20132679 (2009)","journal-title":"J. Algebra"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"813","DOI":"10.1515\/JGT.2009.015","volume":"12","author":"J.B. Wilson","year":"2009","unstructured":"Wilson, J.B.: Finding central decompositions of p-groups. J. Group Theory\u00a012, 813\u2013830 (2009)","journal-title":"J. Group Theory"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31594-7_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T12:11:42Z","timestamp":1743595902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31594-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315930","9783642315947"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31594-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}