{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,3]],"date-time":"2023-10-03T19:14:21Z","timestamp":1696360461550},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T00:00:00Z","timestamp":1603238400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T00:00:00Z","timestamp":1603238400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s00224-020-10010-z","type":"journal-article","created":{"date-parts":[[2020,10,21]],"date-time":"2020-10-21T08:02:59Z","timestamp":1603267379000},"page":"497-514","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes"],"prefix":"10.1007","volume":"65","author":[{"given":"Bireswar","family":"Das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shivdutt","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,21]]},"reference":[{"issue":"2","key":"10010_CR1","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/1944857.1944859","volume":"2","author":"V Arvind","year":"2011","unstructured":"Arvind, V., Tor\u00e1n, J: Solvable group isomorphism is (almost) in NP \u2229 coNP. ACM Transactions on Computation Theory 2(2), 4:1\u20134:22 (2011)","journal-title":"ACM Transactions on Computation Theory"},{"key":"10010_CR2","unstructured":"Babai, L., Qiao, Y.: Polynomial-time isomorphism test for groups with abelian sylow towers. In: STACS\u201912 (29th Symposium on theoretical aspects of computer science), 14, pp 453\u2013464, LIPIcs (2012)"},{"key":"10010_CR3","doi-asserted-by":"publisher","unstructured":"Babai, L., Codenotti, P., Qiao, Y.: Polynomial-time isomorphism test for groups with no abelian normal subgroups - (extended abstract). In: Automata, languages, and programming - 39th international colloquium, ICALP 2012, warwick, uk, july 9-13, 2012, proceedings, part I, pp 51\u201362 (2012), https:\/\/doi.org\/10.1007\/978-3-642-31594-7_5","DOI":"10.1007\/978-3-642-31594-7_5"},{"issue":"2","key":"10010_CR4","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","volume":"25","author":"RB Boppana","year":"1987","unstructured":"Boppana, R.B., Hastad, J., Zachos, S.: Does co-np have short interactive proofs?. Inf. Process. Lett. 25(2), 127\u2013132 (1987)","journal-title":"Inf. Process. Lett."},{"key":"10010_CR5","volume-title":"Introduction to the theory of groups of finite order","author":"RD Carmichael","year":"1937","unstructured":"Carmichael, R.D.: Introduction to the theory of groups of finite order. GINN and Company, Oxford (1937)"},{"issue":"32","key":"10010_CR6","doi-asserted-by":"publisher","first-page":"4110","DOI":"10.1016\/j.tcs.2010.06.011","volume":"412","author":"L Chen","year":"2011","unstructured":"Chen, L., Fu, B.: Linear and sublinear time algorithms for the basis of abelian groups. Theor. Comput. Sci. 412(32), 4110\u20134122 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"10010_CR7","doi-asserted-by":"crossref","unstructured":"Das, B., Sharma, S.: Nearly linear time isomorphism algorithms for some nonabelian group classes. In: International computer science symposium in Russia, pp 80\u201392, Springer (2019)","DOI":"10.1007\/978-3-030-19955-5_8"},{"key":"10010_CR8","unstructured":"Gall, F.L.: Efficient isomorphism testing for a class of group extensions. In: 26th International symposium on theoretical aspects of computer science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings, pp 625\u2013636 (2009)"},{"issue":"2","key":"10010_CR9","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 2-nilpotent groups. J. Comput. Syst. Sci. 42(2), 237\u2013248 (1991)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"10010_CR10","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1137\/15M1009767","volume":"46","author":"JA Grochow","year":"2017","unstructured":"Grochow, J.A., Qiao, Y.: Algorithms for group isomorphism via group extensions and cohomology. SIAM J. Comput. 46(4), 1153\u20131216 (2017)","journal-title":"SIAM J. Comput."},{"key":"10010_CR11","doi-asserted-by":"publisher","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. Chapman and Hall\/CRC, Florida (2005)"},{"key":"10010_CR12","doi-asserted-by":"crossref","unstructured":"Hungerford, T.W.: Algebra, volume 73 of graduate texts in mathematics. Springer-Verlag, New York (1980)","DOI":"10.1007\/978-1-4612-6101-8"},{"issue":"04","key":"10010_CR13","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1142\/S1793830911001401","volume":"3","author":"G Karagiorgos","year":"2011","unstructured":"Karagiorgos, G., Poulakis, D.: Efficient algorithms for the basis of finite abelian groups. Discrete Mathematics, Algorithms and Applications 3 (04), 537\u2013552 (2011)","journal-title":"Discrete Mathematics, Algorithms and Applications"},{"key":"10010_CR14","doi-asserted-by":"crossref","unstructured":"Kayal, N., Nezhmetdinov, T.: Factoring groups efficiently. In: International colloquium on automata, languages, and programming, pp 585\u2013596, Springer (2009)","DOI":"10.1007\/978-3-642-02927-1_49"},{"key":"10010_CR15","volume-title":"Lectures on polynomial-time computation in groups","author":"EM Luks","year":"1990","unstructured":"Luks, E.M.: Lectures on polynomial-time computation in groups. University of Oregon. Department of Computer and Information Science, Eugene (1990)"},{"key":"10010_CR16","doi-asserted-by":"crossref","unstructured":"Miller, G.L.: On the $n^{\\log n}$ isomorphism technique (a preliminary report). In: Proceedings of the tenth annual ACM symposium on theory of computing, pp 51\u201358, ACM (1978)","DOI":"10.1145\/800133.804331"},{"issue":"4","key":"10010_CR17","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/s11390-012-1255-7","volume":"27","author":"Y-M Qiao","year":"2012","unstructured":"Qiao, Y-M, Sarma, J., Tang, B-S: On isomorphism testing of groups with normal hall subgroups. J. Comput. Sci. Technol. 27(4), 687\u2013701 (2012)","journal-title":"J. Comput. Sci. Technol."},{"issue":"4","key":"10010_CR18","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/S0097539797325387","volume":"29","author":"S Rajagopalan","year":"2000","unstructured":"Rajagopalan, S., Schulman, L.J.: Verification of identities. SIAM J. Comput. 29(4), 1155\u20131163 (2000)","journal-title":"SIAM J. Comput."},{"key":"10010_CR19","doi-asserted-by":"crossref","unstructured":"Rosenbaum, D.J.: Breaking the $\\mathcal {O}(n \\log n)$ barrier for solvable-group isomorphism. In: Proceedings of the twenty-fourth annual ACM-SIAM symposium on discrete algorithms, pp 1054\u20131073, Society for industrial and applied mathematics (2013)","DOI":"10.1137\/1.9781611973105.76"},{"key":"10010_CR20","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.tcs.2015.05.036","volume":"593","author":"DJ Rosenbaum","year":"2015","unstructured":"Rosenbaum, D.J., Wagner, F.: Beating the generator-enumeration bound for p-group isomorphism. Theor. Comput. Sci. 593, 16\u201325 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"10010_CR21","unstructured":"Savage, C.D.: An $\\mathcal {O}(n^2)$ algorithm for abelian group isomorphism. Computer Studies [Program], North Carolina State University (1980)"},{"key":"10010_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546549","volume-title":"Permutation group algorithms, vol. 152","author":"A Seress","year":"2003","unstructured":"Seress, A., Seress, A.: Permutation group algorithms, vol. 152. Cambridge University Press, Cambridge (2003)"},{"issue":"6","key":"10010_CR23","doi-asserted-by":"publisher","first-page":"986","DOI":"10.1016\/j.jcss.2007.03.013","volume":"73","author":"K Telikepalli","year":"2007","unstructured":"Telikepalli, K.: 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."},{"issue":"1","key":"10010_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jcss.1996.0045","volume":"53","author":"N Vikas","year":"1996","unstructured":"Vikas, N.: An $\\mathcal {O}(n)$ algorithm for abelian p-group isomorphism and an $\\mathcal {O}(n \\log n)$ algorithm for abelian group isomorphism. J. Comput. Syst. Sci. 53(1), 1\u20139 (1996)","journal-title":"J. Comput. Syst. Sci."},{"key":"10010_CR25","unstructured":"Wilson, J.B.: Finding direct product decompositions in polynomial time (2010)"},{"issue":"1","key":"10010_CR26","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1515\/gcc-2012-0007","volume":"4","author":"JB Wilson","year":"2012","unstructured":"Wilson, J.B.: Existence, algorithms, and asymptotics of direct product decompositions, i. Groups-Complexity-Cryptology 4(1), 33\u201372 (2012)","journal-title":"Groups-Complexity-Cryptology"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-020-10010-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-020-10010-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-020-10010-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,20]],"date-time":"2021-10-20T23:18:53Z","timestamp":1634771933000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-020-10010-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,21]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["10010"],"URL":"https:\/\/doi.org\/10.1007\/s00224-020-10010-z","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,21]]},"assertion":[{"value":"24 September 2020","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2020","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}