{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,18]],"date-time":"2025-04-18T09:05:15Z","timestamp":1744967115297,"version":"3.40.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,7,1]],"date-time":"2012-07-01T00:00:00Z","timestamp":1341100800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s11390-012-1255-7","type":"journal-article","created":{"date-parts":[[2012,7,13]],"date-time":"2012-07-13T08:31:36Z","timestamp":1342168296000},"page":"687-701","source":"Crossref","is-referenced-by-count":6,"title":["On Isomorphism Testing of Groups with Normal Hall Subgroups"],"prefix":"10.1007","volume":"27","author":[{"given":"You-Ming","family":"Qiao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayalal Sarma","family":"M.N.","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bang-Sheng","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,7,12]]},"reference":[{"key":"1255_CR1","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1007\/BF01456932","volume":"71","author":"M Dehn","year":"1911","unstructured":"Dehn M. \u00dcber unendliche diskontinuierliche gruppen. Mathematische Annalen, 1911, 71: 116\u2013144.","journal-title":"\u00dcber unendliche diskontinuierliche gruppen. Mathematische Annalen"},{"key":"1255_CR2","first-page":"231","volume":"6","author":"S Adian","year":"1957","unstructured":"Adian S. The unsolvability of certain algorithmic problems in the theory of groups. Trudy Moskov. Math. Obshch, 1957, 6: 231\u2013298.","journal-title":"Trudy Moskov. Math. Obshch"},{"key":"1255_CR3","doi-asserted-by":"crossref","unstructured":"Babai L, Szemer\u00e9di E. On the complexity of matrix group problems i. In Proc. IEEE Annual Symposium on Foundations of Computer Science (FOCS), West Palm Beach, Florida, USA, October 24\u201326, 1984, pp.229\u2013240.","DOI":"10.1109\/SFCS.1984.715919"},{"key":"1255_CR4","doi-asserted-by":"crossref","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. Boston: Birkhauser, 1993."},{"key":"1255_CR5","unstructured":"Chattopadhyay A, Tor\u00e1n J, Wagner F. Graph isomorphism is not AC 0 reducible to group isomorphism. In Proc. Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), Chennai, India, Dec. 15\u201318, 2010, pp.317\u2013326."},{"key":"1255_CR6","doi-asserted-by":"crossref","unstructured":"Babai L, Luks E M. Canonical labeling of graphs. In Proc. the 15th Annual ACM Symposium on Theory of Computing (STOC), Boston, Massachusetts, USA, April 25\u201327, 1983, pp.171\u2013183.","DOI":"10.1145\/800061.808746"},{"key":"1255_CR7","doi-asserted-by":"crossref","unstructured":"Miller G\u00a0L. On the nlogn isomorphism technique. In Proc. the 10th Annual ACM Symposium on Theory of Computing, San Diego, California, USA, May 1\u20133, 1978, pp.51\u201358.","DOI":"10.1145\/800133.804331"},{"key":"1255_CR8","unstructured":"Lipton R J, Snyder L, Zalcstein Y. The complexity of word and isomorphism problems for finite groups. Technical Report, John Hopkins, 1976."},{"key":"1255_CR9","unstructured":"Savage C. An O(n 2) algorithm for abelian group isomorphism. Technical Report, North Carolina State University, 1980."},{"issue":"1","key":"1255_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jcss.1996.0045","volume":"53","author":"N Vikas","year":"1996","unstructured":"Vikas N. An O(n) algorithm for abelian p-group isomorphism and an O(n log n) algorithm for abelian group isomorphism. Journal of Computer and System Sciences, 1996, 53(1): 1\u20139.","journal-title":"Journal of Computer and System Sciences"},{"issue":"6","key":"1255_CR11","doi-asserted-by":"crossref","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. Journal of Computer and System Sciences, 2007, 73(6): 986\u2013996.","journal-title":"Journal of Computer and System Sciences"},{"key":"1255_CR12","unstructured":"Gall F\u00a0L. Efficient isomorphism testing for a class of group extensions. In Proc. the 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009), Freiburg, Germany, February 26\u201328, 2009, pp.625\u2013636."},{"issue":"8","key":"1255_CR13","doi-asserted-by":"crossref","first-page":"2642","DOI":"10.1016\/j.jalgebra.2009.07.029","volume":"322","author":"JB Wilson","year":"2009","unstructured":"Wilson J B. Decomposing p-groups via Jordan algebras. Journal of Algebra, 2009, 322(8): 2642\u20132679.","journal-title":"Journal of Algebra"},{"issue":"6","key":"1255_CR14","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1515\/JGT.2009.015","volume":"12","author":"JB Wilson","year":"2009","unstructured":"Wilson J B. Finding central decompositions of p-groups. Journal of Group Theory, 2009, 12(6): 813\u2013830.","journal-title":"Journal of Group Theory"},{"key":"1255_CR15","doi-asserted-by":"crossref","unstructured":"Kayal N, Nezhmetdinov T. Factoring groups efficiently. In Proc. the 36th International Colloquium on Automata, Languages and Programming (ICALP 2009), Rhodes, Greece, July 5\u201312, 2009, pp.585\u2013596.","DOI":"10.1007\/978-3-642-02927-1_49"},{"key":"1255_CR16","unstructured":"Wilson J B. Finding direct product decompositions in polynomial time. 2010. http:\/\/arxiv.org\/pdf\/1005.0548.pdf ."},{"issue":"1","key":"1255_CR17","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1017\/S030500410002987X","volume":"51","author":"DR Taunt","year":"1955","unstructured":"Taunt D R. Remarks on the isomorphism problem in theories of construction of finite groups. Mathematical Proceedings of the Cambridge Philosophical Society, 1955, 51(1): 16\u201324.","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"1255_CR18","doi-asserted-by":"crossref","first-page":"117","DOI":"10.33232\/BIMS.0050.117.128","volume":"50","author":"F Menegazzo","year":"2003","unstructured":"Menegazzo F. The number of generators of a finite group. Irish Math. Soc. Bulletin, 2003, 50: 117\u2013128.","journal-title":"Irish Math. Soc. Bulletin"},{"key":"1255_CR19","unstructured":"Babai L. Equivalence of linear codes. Technical Report, University of Chicago, 2010."},{"key":"1255_CR20","unstructured":"Babai L, Codenotti P, Grochow J, Qiao Y. Towards efficient algorithm for semisimple group isomorphism. In Proc. ACMSIAM Annual Symposium of Discrete Algorithms (SODA), San Francisco, California, USA, January 23\u201325, 2011."},{"key":"1255_CR21","doi-asserted-by":"crossref","DOI":"10.1201\/9781420035216","volume-title":"Handbook of Computational Group Theory","author":"DF Holt","year":"2005","unstructured":"Holt D F, Eick B, O\u2019Brien E A. Handbook of Computational Group Theory. London: Chapman and Hall\/CRC, 2005."},{"key":"1255_CR22","doi-asserted-by":"crossref","unstructured":"Rotman J\u00a0J. An Introduction to the Theory of Groups (4th edition). Springer-Verlag, 1995.","DOI":"10.1007\/978-1-4612-4176-8"},{"key":"1255_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-9458-7","volume-title":"Linear Representations of Finite Groups","author":"JP Serre","year":"1977","unstructured":"Serre J P. Linear Representations of Finite Groups. New York: Springer-Verlag, 1977."},{"issue":"3","key":"1255_CR24","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/S0747-7171(08)80017-X","volume":"9","author":"L R\u00f3nyai","year":"1990","unstructured":"R\u00f3nyai L. Computing the structure of finite algebras. Journal of Symbolic Computation, 1990, 9(3): 355\u2013373.","journal-title":"Journal of Symbolic Computation"},{"issue":"5","key":"1255_CR25","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0020-0190(90)90195-4","volume":"33","author":"V Shoup","year":"1990","unstructured":"Shoup V. On the deterministic complexity of factoring polynomials over finite fields. Information Processing Letters, 1990, 33(5): 261\u2013267.","journal-title":"Information Processing Letters"},{"issue":"3\u20134","key":"1255_CR26","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1006\/jsco.1996.0142","volume":"24","author":"A Steel","year":"1997","unstructured":"Steel A. A new algorithm for the computation of canonical forms of matrices over fields. Journal of Symbolic Computation, 1997, 24(3\u20134): 409\u2013432.","journal-title":"Journal of Symbolic Computation"},{"key":"1255_CR27","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546549","volume-title":"Permutation Group Algorithms","author":"A Seress","year":"2003","unstructured":"Seress A. Permutation Group Algorithms. Cambridge: Cambridge University Press, 2003."},{"key":"1255_CR28","unstructured":"Babai L. Coset intersection in moderately exponential time. Chicago Journal of Theoretical Computer Science, to appear."},{"key":"1255_CR29","doi-asserted-by":"crossref","unstructured":"Luks E M. Hypergraph isomorphism and structural equivalence of Boolean functions. In Proc. the 31st Annual ACM Symposium on Theory of Computing, Atlanta, Georgia, USA, May 1\u20134, 1999, pp.652\u2013658.","DOI":"10.1145\/301250.301427"},{"issue":"1","key":"1255_CR30","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1006\/jagm.1999.0982","volume":"31","author":"WM Kantor","year":"1999","unstructured":"Kantor W\u00a0M, Luks E M, Mark P D. Sylow subgroups in parallel. Journal of Algorithms, 1999, 31(1): 132\u2013195.","journal-title":"Journal of Algorithms"},{"key":"1255_CR31","unstructured":"Babai L, Qiao Y. Polynomial-time isomorphism test for groups with abelian Sylow towers. In Proc. the 29th International Symposium on Theoretical Aspects of Computer Science, Pairs, France, Feb. 28-March 3, 2012, pp.453\u2013464."},{"issue":"5","key":"1255_CR32","doi-asserted-by":"crossref","first-page":"1602","DOI":"10.1109\/18.623157","volume":"43","author":"E Petrank","year":"1997","unstructured":"Petrank E, Roth R M. Is code equivalence easy to decide? IEEE Trans. Information Theory, 1997, 43(5): 1602\u20131604.","journal-title":"IEEE Trans. Information Theory"},{"issue":"252","key":"1255_CR33","doi-asserted-by":"crossref","first-page":"2017","DOI":"10.1090\/S0025-5718-05-01740-0","volume":"74","author":"J Buchmann","year":"2005","unstructured":"Buchmann J, Schmidt A. Computing the structure of a finite abelian group. Mathematics of Computation, 2005, 74(252): 2017\u20132026.","journal-title":"Mathematics of Computation"},{"issue":"1","key":"1255_CR34","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1090\/S0002-9947-1907-1500775-1","volume":"8","author":"A Ranum","year":"1907","unstructured":"Ranum A. The group of classes of congruent matrices with application to the group of isomorphisms of any abelian group. Transactions of the American Mathematical Society, 1907, 8(1): 71\u201391.","journal-title":"Transactions of the American Mathematical Society"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-012-1255-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-012-1255-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-012-1255-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T23:31:21Z","timestamp":1743723081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-012-1255-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["1255"],"URL":"https:\/\/doi.org\/10.1007\/s11390-012-1255-7","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"type":"print","value":"1000-9000"},{"type":"electronic","value":"1860-4749"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}