{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T21:43:32Z","timestamp":1768686212957,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662489703","type":"print"},{"value":"9783662489710","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48971-0_49","type":"book-chapter","created":{"date-parts":[[2015,11,26]],"date-time":"2015-11-26T04:00:57Z","timestamp":1448510457000},"page":"578-589","source":"Crossref","is-referenced-by-count":4,"title":["Polynomial-Time Isomorphism Test of Groups that are Tame Extensions"],"prefix":"10.1007","author":[{"given":"Joshua A.","family":"Grochow","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youming","family":"Qiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,27]]},"reference":[{"key":"49_CR1","first-page":"1","volume":"151","author":"JL Alperin","year":"1970","unstructured":"Alperin, J.L., Brauer, R., Gorenstein, D.: Finite groups with quasi-dihedral and wreathed Sylow 2-subgroups. Trans. Amer. Math. Soc. 151, 1\u2013261 (1970)","journal-title":"Trans. Amer. Math. Soc."},{"key":"49_CR2","first-page":"1447","volume-title":"Handbook of Combinatorics (vol. 2)","author":"L Babai","year":"1995","unstructured":"Babai, L.: Automorphism groups, isomorphism, reconstruction. In: Graham, R.L., Gr\u00f6tschel, M., Lov\u00e1sz, L. (eds.) Handbook of Combinatorics (vol. 2), pp. 1447\u20131540. MIT Press, Cambridge (1995)"},{"key":"49_CR3","doi-asserted-by":"crossref","unstructured":"Babai, L., Codenotti, P., Grochow, J.A., Qiao, Y: Code equivalence and group isomorphism. In: Proceedings of 22nd SODA, pp. 1395\u20131408 (2011)","DOI":"10.1137\/1.9781611973082.107"},{"key":"49_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-31594-7_5","volume-title":"Automata, Languages, and Programming","author":"L Babai","year":"2012","unstructured":"Babai, L., Codenotti, P., Qiao, Y.: Polynomial-time isomorphism test for groups with no Abelian normal subgroups. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol. 7391, pp. 51\u201362. Springer, Heidelberg (2012)"},{"key":"49_CR5","doi-asserted-by":"publisher","unstructured":"Babai, L., Qiao, Y.: Polynomial-time isomorphism test for groups with Abelian Sylow towers. In: D\u00fcrr, C., Wilke, T. (eds.) 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012. LIPIcs, vol. 14, pp. 453\u2013464. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012). doi:\n                      10.4230\/LIPIcs.STACS.2012.453","DOI":"10.4230\/LIPIcs.STACS.2012.453"},{"key":"49_CR6","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/S0024-3795(02)00391-9","volume":"361","author":"GR Belitskii","year":"2003","unstructured":"Belitskii, G.R., Sergeichuk, V.V.: Complexity of matrix problems. Linear Algebra Appl 361, 203\u2013222 (2003). Ninth Conference of the International Linear Algebra Society (Haifa, 2001)","journal-title":"Linear Algebra Appl"},{"issue":"1","key":"49_CR7","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/0021-8693(81)90254-4","volume":"70","author":"H Bender","year":"1981","unstructured":"Bender, H.: Finite groups with dihedral Sylow \n                      \n                        \n                      \n                      $$2$$\n                    -subgroups. J. Algebra 70(1), 216\u2013228 (1981)","journal-title":"J. Algebra"},{"key":"49_CR8","volume-title":"Representations and Cohomology: Volume 1, Basic Representation Theory of Finite Groups and Associative Algebras","author":"DJ Benson","year":"1998","unstructured":"Benson, D.J.: Representations and Cohomology: Volume 1, Basic Representation Theory of Finite Groups and Associative Algebras. Cambridge University Press, Cambridge (1998). Cambridge Studies in Advanced Mathematics"},{"issue":"11","key":"49_CR9","doi-asserted-by":"publisher","first-page":"4020","DOI":"10.1016\/j.jalgebra.2008.07.014","volume":"320","author":"PA Brooksbank","year":"2008","unstructured":"Brooksbank, P.A., Luks, E.M.: Testing isomorphism of modules. J. Algebra 320(11), 4020\u20134029 (2008)","journal-title":"J. Algebra"},{"key":"49_CR10","unstructured":"Brooksbank, P.A., Maglione, J, Wilson, J.B.: A fast isomorphism test for groups of genus 2. \n                      arXiv:1508.03033\n                      \n                     [math.GR] (2015)"},{"issue":"02","key":"49_CR11","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1142\/S021819670800441X","volume":"18","author":"PA Brooksbank","year":"2008","unstructured":"Brooksbank, P.A., O\u2019Brien, E.A.: Constructing the group preserving a system of forms. Int. J. Algebra Comput. 18(02), 227\u2013241 (2008)","journal-title":"Int. J. Algebra Comput."},{"key":"49_CR12","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0747-7171(02)00133-5","volume":"35","author":"JJ Cannon","year":"2003","unstructured":"Cannon, J.J., Holt, D.F.: Automorphism group computation and isomorphism testing in finite groups. J. Symb. Comput. 35, 241\u2013267 (2003)","journal-title":"J. Symb. Comput."},{"key":"49_CR13","doi-asserted-by":"crossref","unstructured":"Chistov, A.L., Ivanyos, G., Karpinski, M.: Polynomial time algorithms for modules over finite dimensional algebras. In: ISSAC, pp. 68\u201374 (1997)","DOI":"10.1145\/258726.258751"},{"key":"49_CR14","unstructured":"Conrad, K: Generalized quaternions (2013). \n                      http:\/\/www.math.uconn.edu\/~kconrad\/blurbs\/grouptheory\/genquat.pdf"},{"key":"49_CR15","volume-title":"Representation Theory of Finite Groups and Associative Algebras","author":"CW Curtis","year":"1966","unstructured":"Curtis, C.W., Reiner, I.: Representation Theory of Finite Groups and Associative Algebras. Interscience Publishers, New York (1966). AMS Chelsea Publishing Series"},{"key":"49_CR16","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/BFb0088467","volume-title":"Representation Theory II","author":"JA Drozd","year":"1980","unstructured":"Drozd, J.A.: Tame and wild matrix problems. In: Dlab, V., Gabriel, P. (eds.) Representation Theory II. Lecture Notes in Mathematics, pp. 242\u2013258. Springer, Heidelberg (1980)"},{"key":"49_CR17","first-page":"59","volume-title":"Computational Problems in Abstract Algebra (Proceedings of a Conference on Computational Problems in Algebra, Oxford, 1967)","author":"V Felsch","year":"1970","unstructured":"Felsch, V., Neub\u00fcser, J.: On a programme for the determination of the automorphism group of a finite group. In: Leech, P.J. (ed.) Computational Problems in Abstract Algebra (Proceedings of a Conference on Computational Problems in Algebra, Oxford, 1967), pp. 59\u201360. Pergamon Press, Oxford (1970)"},{"issue":"2","key":"49_CR18","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0022-0000(91)90012-T","volume":"42","author":"M Garzon","year":"1991","unstructured":"Garzon, M., Zalcstein, Y.: On isomorphism testing of a class of \n                      \n                        \n                      \n                      $$2$$\n                    -nilpotent groups. J. Comput. Syst. Sci. 42(2), 237\u2013248 (1991)","journal-title":"J. Comput. Syst. Sci."},{"key":"49_CR19","volume-title":"Finite groups","author":"D Gorenstein","year":"1980","unstructured":"Gorenstein, D.: Finite groups, 2nd edn. Chelsea Publishing Co., New York (1980)","edition":"2"},{"key":"49_CR20","doi-asserted-by":"crossref","unstructured":"Gorenstein, D, Walter, J.H.: The characterization of finite groups with dihedral Sylow \n                      \n                        \n                      \n                      $$2$$\n                    -subgroups. I-III. J. Algebra, 2:85\u2013151, 218\u2013270, 354\u2013393 (1965)","DOI":"10.1016\/0021-8693(65)90015-3"},{"key":"49_CR21","unstructured":"Grochow, J.A.: Matrix isomorphism of matrix Lie algebras. In: IEEE Conference on Computational Complexity, pp. 203\u2013213 (2012). Also available as \n                      arXiv:1112.2012\n                      \n                     and ECCC TR11-168"},{"key":"49_CR22","unstructured":"Grochow, J.A., Qiao, Y.: Algorithms for group isomorphism via group extensions and cohomology. In: IEEE Conference on Computational Complexity (CCC14), pp. 110\u2013119 (2014). Also available as \n                      arXiv:1309.1776\n                      \n                     [cs.DS] and ECCC Technical Report TR13-123"},{"key":"49_CR23","doi-asserted-by":"crossref","unstructured":"Joshua A. Grochow and Youming Qiao. Polynomial-time isomorphism test of groups that are tame extensions. \n                      arXiv:1507.0191\n                      \n                    7 [cs.DS] (2015)","DOI":"10.1007\/978-3-662-48971-0_49"},{"issue":"4","key":"49_CR24","doi-asserted-by":"publisher","first-page":"469","DOI":"10.4171\/GGD\/22","volume":"1","author":"R Guralnick","year":"2007","unstructured":"Guralnick, R., Kantor, W.M., Kassabov, M., Lubotzky, A.: Presentations of finite simple groups: profinite and cohomological approaches. Groups Geom. Dyn. 1(4), 469\u2013523 (2007)","journal-title":"Groups Geom. Dyn."},{"issue":"8","key":"49_CR25","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1137\/090781231","volume":"39","author":"G Ivanyos","year":"2010","unstructured":"Ivanyos, G., Karpinski, M., Saxena, N.: Deterministic polynomial time algorithms for matrix completion problems. SIAM J. Comput. 39(8), 3736\u20133751 (2010)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"49_CR26","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. 73(6), 986\u2013996 (2007)","journal-title":"J. Comput. Syst. Sci."},{"key":"49_CR27","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0333-9","volume-title":"The Graph Isomorphism Problem: Its Structural Complexity","author":"J K\u00f6bler","year":"1993","unstructured":"K\u00f6bler, J., Sch\u00f6ning, U., Tor\u00e1n, J.: The Graph Isomorphism Problem: Its Structural Complexity. Birkhauser Verlag, Basel (1993)"},{"key":"49_CR28","unstructured":"Le Gall, F.: Efficient isomorphism testing for a class of group extensions. In: Proceedings of 26th STACS, pp. 625\u2013636 (2009)"},{"issue":"1","key":"49_CR29","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1515\/gcc-2012-0008","volume":"4","author":"ML Lewis","year":"2012","unstructured":"Lewis, M.L., Wilson, J.B.: Isomorphism in expanding families of indistinguishable groups. Groups Complex. Cryptol. 4(1), 73\u2013110 (2012)","journal-title":"Groups Complex. Cryptol."},{"key":"49_CR30","doi-asserted-by":"crossref","unstructured":"Miller, G.L.: On the \n                      \n                        \n                      \n                      $$n^{\\log n}$$\n                     isomorphism technique (a preliminary report). In: Proceedings of 10th ACM STOC, pp. 51\u201358. ACM Press, New York (1978)","DOI":"10.1145\/800133.804331"},{"issue":"2","key":"49_CR31","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/1944345.1944346","volume":"58","author":"K Mulmuley","year":"2011","unstructured":"Mulmuley, K.: On \n                      \n                        \n                      \n                      $${\\sf P}$$\n                     vs. \n                      \n                        \n                      \n                      $${\\sf NP}$$\n                     and geometric complexity theory. J. ACM 58(2), 5 (2011)","journal-title":"J. ACM"},{"key":"49_CR32","unstructured":"Qiao, Y, Sarma, J.M.N., Tang, B.: On isomorphism testing of groups with normal Hall subgroups. In: Proceedings of 28th STACS, pp. 567\u2013578 (2011)"},{"key":"49_CR33","unstructured":"Rickard, J.: Answer to: the number of indecomposable modules of finite groups over finite fields of a fixed dimension. \n                      http:\/\/mathoverflow.net\/a\/194773\/8012"},{"key":"49_CR34","unstructured":"Rosenbaum, D: Bidirectional collision detection and faster algorithms for isomorphism problems. \n                      arXiv:1304.3935\n                      \n                     [cs.DS] (2013)"},{"key":"49_CR35","unstructured":"Savage, C.: An \n                      \n                        \n                      \n                      $${O}(n^2)$$\n                     algorithm for Abelian group isomorphism. Technical report, North Carolina State University (1980)"},{"key":"49_CR36","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546549","volume-title":"Permutation Group Algorithms","author":"\u00c1 Seress","year":"2003","unstructured":"Seress, \u00c1.: Permutation Group Algorithms. Cambridge University Press, Cambridge (2003)"},{"key":"49_CR37","unstructured":"Serge\u012d\u010duk, V.V.: The classification of metabelian \n                      \n                        \n                      \n                      $$p$$\n                    -groups. In: Matrix Problems (Russian), pp. 150\u2013161. Akad. Nauk Ukrain. SSR Inst. Mat., Kiev (1977)"},{"issue":"1","key":"49_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jcss.1996.0045","volume":"53","author":"N Vikas","year":"1996","unstructured":"Vikas, N.: An \n                      \n                        \n                      \n                      $${O}(n)$$\n                     algorithm for Abelian \n                      \n                        \n                      \n                      $$p$$\n                    -group isomorphism and an \n                      \n                        \n                      \n                      $${O}(n \\log n)$$\n                     algorithm for Abelian group isomorphism. J. Comput. Syst. Sci. 53(1), 1\u20139 (1996)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48971-0_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T18:02:35Z","timestamp":1559325755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48971-0_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662489703","9783662489710"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48971-0_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}