{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:37:17Z","timestamp":1743021437635,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030250263"},{"type":"electronic","value":"9783030250270"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-25027-0_16","type":"book-chapter","created":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:04:09Z","timestamp":1564617849000},"page":"229-242","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Succinct Representations of Finite Groups"],"prefix":"10.1007","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"}]},{"given":"P. R.","family":"Vaidyanathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,10]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Babai, L.: Graph isomorphism in quasipolynomial time. In: Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, pp. 684\u2013697. ACM (2016). https:\/\/doi.org\/10.1145\/2897518.2897542","key":"16_CR1","DOI":"10.1145\/2897518.2897542"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1016\/S0195-6698(89)80067-8","volume":"10","author":"L Babai","year":"1989","unstructured":"Babai, L., Kantor, W.M., Lubotsky, A.: Small-diameter cayley graphs for finite simple groups. Eur. J. Comb. 10, 507\u2013522 (1989). https:\/\/doi.org\/10.1016\/S0195-6698(89)80067-8","journal-title":"Eur. J. Comb."},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","volume":"38","author":"DA Barrington","year":"1989","unstructured":"Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in NC$$^1$$. J. Comput. Syst. Sci. 38, 150\u2013164 (1989). https:\/\/doi.org\/10.1016\/0022-0000(89)90037-8","journal-title":"J. Comput. Syst. Sci."},{"unstructured":"Carmichael, R.D.: Introduction to the Theory of Groups of Finite Order. GINN and Company (1937)","key":"16_CR4"},{"key":"16_CR5","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, 4110\u20134122 (2011). https:\/\/doi.org\/10.1016\/j.tcs.2010.06.011","journal-title":"Theor. Comput. Sci."},{"key":"16_CR6","volume-title":"Abstract Algebra","author":"DS Dummit","year":"2004","unstructured":"Dummit, D.S., Foote, R.M.: Abstract Algebra, vol. 3. Wiley, Hoboken (2004)"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF02806383","volume":"14","author":"P Erd\u00f6s","year":"1965","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: Probabilistic methods in group theory. J. d\u2019Analyse Math. 14, 127\u2013138 (1965). https:\/\/doi.org\/10.1007\/BF02806383","journal-title":"J. d\u2019Analyse Math."},{"doi-asserted-by":"crossref","unstructured":"Eugene, M.: Permutation groups and polynomial-time computation. In: Groups and Computation: Workshop on Groups and Computation, 7\u201310 October 1991, vol. 11, p. 139. American Mathematical Society (1993)","key":"16_CR8","DOI":"10.1090\/dimacs\/011\/11"},{"doi-asserted-by":"publisher","unstructured":"Farzan, A., Munro, J.I.: Succinct representation of finite abelian groups. In: Proceedings of the Symbolic and Algebraic Computation, International Symposium, ISSAC 2006, Genoa, Italy, 9\u201312 July 2006, pp. 87\u201392. ACM (2006). https:\/\/doi.org\/10.1145\/1145768.1145788","key":"16_CR9","DOI":"10.1145\/1145768.1145788"},{"key":"16_CR10","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, 986\u2013996 (2007). https:\/\/doi.org\/10.1016\/j.jcss.2007.03.013","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-642-02927-1_49","volume-title":"Automata, Languages and Programming","author":"N Kayal","year":"2009","unstructured":"Kayal, N., Nezhmetdinov, T.: Factoring groups efficiently. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 585\u2013596. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02927-1_49"},{"unstructured":"Kumar, S.R., Rubinfeld, R.: Property testing of abelian group operations (1998)","key":"16_CR12"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/S0747-7171(08)80081-8","volume":"9","author":"CR Leedham-Green","year":"1990","unstructured":"Leedham-Green, C.R., Soicher, L.H.: Collection from the left and other strategies. J. Symb. Comput. 9, 665\u2013675 (1990). https:\/\/doi.org\/10.1016\/S0747-7171(08)80081-8","journal-title":"J. Symb. Comput."},{"doi-asserted-by":"publisher","unstructured":"Le Gall, F.: An efficient quantum algorithm for some instances of the group isomorphism problem. In: 27th International Symposium on Theoretical Aspects of Computer Science, vol. 5, pp. 549\u2013560 (2010). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2010.2484","key":"16_CR14","DOI":"10.4230\/LIPIcs.STACS.2010.2484"},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/0022-0000(82)90009-5","volume":"25","author":"EM Luks","year":"1982","unstructured":"Luks, E.M.: Isomorphism of graphs of bounded valence can be tested in polynomial time. J. Comput. Syst. Sci. 25, 42\u201365 (1982). https:\/\/doi.org\/10.1016\/0022-0000(82)90009-5","journal-title":"J. Comput. Syst. Sci."},{"unstructured":"Magnus, W., Karrass, A., Solitar, D.: Combinatorial group theory: presentations of groups in terms of generators and relations. Courier Corporation (2004)","key":"16_CR16"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"398","DOI":"10.2307\/1986409","volume":"4","author":"GA Miller","year":"1903","unstructured":"Miller, G.A., Moreno, H.C.: Non-abelian groups in which every subgroup is abelian. Trans. Am. Math. Soc. 4, 398\u2013404 (1903). https:\/\/doi.org\/10.2307\/1986409","journal-title":"Trans. Am. Math. Soc."},{"doi-asserted-by":"publisher","unstructured":"Qiao, Y., Sarma M.N., J., Tang, B.: On isomorphism testing of groups with normal hall subgroups. In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011), pp. 567\u2013578 (2011). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2011.567","key":"16_CR18","DOI":"10.4230\/LIPIcs.STACS.2011.567"},{"key":"16_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546549","volume-title":"Permutation Group Algorithms","author":"\u00c1 Seress","year":"2003","unstructured":"Seress, \u00c1.: Permutation Group Algorithms, vol. 152. Cambridge University Press, Cambridge (2003)"},{"key":"16_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574702","volume-title":"Computation with Finitely Presented Groups","author":"CC Sims","year":"1994","unstructured":"Sims, C.C.: Computation with Finitely Presented Groups, vol. 48. Cambridge University Press, Cambridge (1994)"},{"key":"16_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jcss.1996.0045","volume":"53","author":"N Vikas","year":"1996","unstructured":"Vikas, N.: An $$\\cal{O}(n)$$ algorithm for abelian $$p$$-group isomorphism and an $$\\cal{O}(n \\log n)$$ algorithm for abelian group isomorphism. J. Comput. Syst. Sci. 53, 1\u20139 (1996). https:\/\/doi.org\/10.1006\/jcss.1996.0045","journal-title":"J. Comput. Syst. Sci."},{"key":"16_CR22","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 Complex. Cryptol. 4, 33\u201372 (2012). https:\/\/doi.org\/10.1515\/gcc-2012-0007","journal-title":"Groups Complex. Cryptol."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-25027-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T13:25:08Z","timestamp":1710336308000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-25027-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030250263","9783030250270"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-25027-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"10 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/di.ku.dk\/fct2019","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}