{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T16:30:09Z","timestamp":1775061009162,"version":"3.50.1"},"publisher-location":"Cham","reference-count":62,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032224682","type":"print"},{"value":"9783032224699","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-22469-9_11","type":"book-chapter","created":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:57:28Z","timestamp":1775055448000},"page":"188-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Complexity of\u00a0Identifying Groups and\u00a0Quasigroups via\u00a0Decompositions"],"prefix":"10.1007","author":[{"given":"Dan","family":"Johnson","sequence":"first","affiliation":[]},{"given":"Michael","family":"Levet","sequence":"additional","affiliation":[]},{"given":"Petr","family":"Vojt\u011bchovsk\u00fd","sequence":"additional","affiliation":[]},{"given":"Brett","family":"Widholm","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,2]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Albert, A.A.: Quasigroups. I. Transactions of the American Mathematical Society 54(3), 507\u2013519 (1943). https:\/\/doi.org\/10.2307\/1990259","DOI":"10.2307\/1990259"},{"issue":"5","key":"11_CR2","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1016\/j.ic.2006.02.002","volume":"204","author":"V Arvind","year":"2006","unstructured":"Arvind, V., Kurur, P.P.: Graph isomorphism is in SPP. Inf. Comput. 204(5), 835\u2013852 (2006). https:\/\/doi.org\/10.1016\/j.ic.2006.02.002","journal-title":"Inf. Comput."},{"issue":"6","key":"11_CR3","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., Lubotsky, A.: Small-diameter Cayley graphs for finite simple groups. Eur. J. Comb. 10(6), 507\u2013522 (1989). https:\/\/doi.org\/10.1016\/S0195-6698(89)80067-8","journal-title":"Eur. J. Comb."},{"key":"11_CR4","doi-asserted-by":"publisher","unstructured":"Babai, L.: Graph isomorphism in quasipolynomial time [extended abstract]. In: STOC 2016\u2014Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, pp. 684\u2013697. ACM, New York (2016). https:\/\/doi.org\/10.1145\/2897518.2897542, preprint of full version at arXiv:1512.03547v2 [cs.DS]","DOI":"10.1145\/2897518.2897542"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Babai, L., Qiao, Y.: Polynomial-time isomorphism test for groups with Abelian Sylow towers. In: 29th STACS. LNCS, vol. 6651m pp. 453 \u2013 464, Springer (2012). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2012.453","DOI":"10.4230\/LIPIcs.STACS.2012.453"},{"issue":"2","key":"11_CR6","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1006\/jcss.2001.1764","volume":"63","author":"DAM Barrington","year":"2001","unstructured":"Barrington, D.A.M., Kadau, P., Lange, K., McKenzie, P.: On the complexity of some problems on groups input as multiplication tables. J. Comput. Syst. Sci. 63(2), 186\u2013200 (2001). https:\/\/doi.org\/10.1006\/jcss.2001.1764","journal-title":"J. Comput. Syst. Sci."},{"issue":"02","key":"11_CR7","doi-asserted-by":"publisher","first-page":"2250021","DOI":"10.1142\/S0219498822500219","volume":"21","author":"M Bonatto","year":"2022","unstructured":"Bonatto, M.: Medial and semimedial left quasigroups. J. Algebra Appli. 21(02), 2250021 (2022). https:\/\/doi.org\/10.1142\/S0219498822500219","journal-title":"J. Algebra Appli."},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Brachter, J., Schweitzer, P.: On the Weisfeiler\u2013Leman dimension of finite groups. In: Hermanns, H., Zhang, L., Kobayashi, N., Miller, D. (eds.) LICS 2020: 35th Annual ACM\/IEEE Symposium on Logic in Computer Science, Saarbr\u00fccken, Germany, 8-11 July 2020, pp. 287\u2013300. ACM (2020). https:\/\/doi.org\/10.1145\/3373718.3394786","DOI":"10.1145\/3373718.3394786"},{"key":"11_CR9","doi-asserted-by":"publisher","unstructured":"Brachter, J., Schweitzer, P.: A systematic study of isomorphism invariants of finite groups via the Weisfeiler-Leman dimension (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2022.27","DOI":"10.4230\/LIPIcs.ESA.2022.27"},{"key":"11_CR10","unstructured":"Brooksbank, P.A., Grochow, J.A., Li, Y., Qiao, Y., Wilson, J.B.: Incorporating Weisfeiler\u2013Leman into algorithms for group isomorphism. arXiv:1905.02518 [cs.CC](2019)"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Bruck, R.H.: Finite nets. II. uniqueness and imbedding. Pacific J. Math. 13(2), 421 \u2013 457 (1963). https:\/\/doi.org\/10.2140\/pjm.1963.13.421","DOI":"10.2140\/pjm.1963.13.421"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Buhrman, H., Homer, S.: Superpolynomial circuits, almost sparse oracles and the exponential hierarchy. In: Shyamasundar, R. (eds) FSTTCS 1992. LNCS, vol. 652. Springer, Berlin (1992). https:\/\/doi.org\/10.1007\/3-540-56287-7_99","DOI":"10.1007\/3-540-56287-7_99"},{"key":"11_CR13","doi-asserted-by":"publisher","unstructured":"Cai, J.Y., F\u00fcrer, M., Immerman, N.: An optimal lower bound on the number of variables for graph identification. Combinatorica 12(4), 389\u2013410 (1992). https:\/\/doi.org\/10.1007\/BF01305232, originally appeared in SFCS 1989","DOI":"10.1007\/BF01305232"},{"key":"11_CR14","doi-asserted-by":"publisher","unstructured":"Chattopadhyay, A., Tor\u00e1n, J., Wagner, F.: Graph isomorphism is not $$\\rm AC^0$$-reducible to group isomorphism. ACM Trans. Comput. Theory 5(4), Art. 13, 13 (2013). https:\/\/doi.org\/10.1145\/2540088, preliminary version appeared in FSTTCS \u201910; ECCC Tech. Report TR10-117","DOI":"10.1145\/2540088"},{"key":"11_CR15","doi-asserted-by":"publisher","unstructured":"Collins, N.A., Grochow, J.A., Levet, M., Wei\u00df, A.: On the constant-depth circuit complexity of generating quasigroups. TheoretiCS 4, 19 (2025). https:\/\/doi.org\/10.46298\/theoretics.25.19, preliminary version in Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation, ISSAC 2024. 10.1145\/3666000.3669691","DOI":"10.46298\/theoretics.25.19"},{"issue":"03","key":"11_CR16","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1142\/S0218196724500103","volume":"34","author":"NA Collins","year":"2024","unstructured":"Collins, N.A., Levet, M.: Count-free Weisfeiler-Leman and group isomorphism. Internat. J. Algebra Comput. 34(03), 283\u2013330 (2024). https:\/\/doi.org\/10.1142\/S0218196724500103","journal-title":"Internat. J. Algebra Comput."},{"issue":"3\u20134","key":"11_CR17","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s00025-009-0370-4","volume":"54","author":"A Drapal","year":"2009","unstructured":"Drapal, A.: Group isotopes and a holomorphic action. Results Math. 54(3\u20134), 253\u2013272 (2009). https:\/\/doi.org\/10.1007\/s00025-009-0370-4","journal-title":"Results Math."},{"key":"11_CR18","doi-asserted-by":"publisher","unstructured":"Ebbinghaus, H.D., Flum, J., Thomas, W.: Mathematical Logic. Springer, 2 edn. (1994). https:\/\/doi.org\/10.1007\/978-1-4757-2355-7","DOI":"10.1007\/978-1-4757-2355-7"},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"Felsch, V., Neub\u00fcser, J.: On a programme for the determination of the automorphism group of a finite group. In: Computational Problems in Abstract Algebra (Proc. Conf., Oxford, 1967), pp. 59\u201360 (1970). https:\/\/doi.org\/10.1016\/B978-0-08-012975-4.50011-4","DOI":"10.1016\/B978-0-08-012975-4.50011-4"},{"issue":"1","key":"11_CR20","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF01744431","volume":"17","author":"ML Furst","year":"1984","unstructured":"Furst, M.L., Saxe, J.B., Sipser, M.: Parity, circuits, and the polynomial-time hierarchy. Math. Syst. Theory 17(1), 13\u201327 (1984). https:\/\/doi.org\/10.1007\/BF01744431","journal-title":"Math. Syst. Theory"},{"issue":"4","key":"11_CR21","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.70015","volume":"66","author":"MJ Gill","year":"2025","unstructured":"Gill, M.J., Mammoliti, A., Wanless, I.M.: Canonical labeling of latin squares in average-case polynomial time. Random Struct. Algorith. 66(4), e70015 (2025). https:\/\/doi.org\/10.1002\/rsa.70015","journal-title":"Random Struct. Algorith."},{"key":"11_CR22","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In: 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), pp. 174\u2013187 (1986). https:\/\/doi.org\/10.1109\/SFCS.1986.47","DOI":"10.1109\/SFCS.1986.47"},{"key":"11_CR23","doi-asserted-by":"publisher","unstructured":"Grochow, J.A., Levet, M.: On the descriptive complexity of groups without abelian normal subgroups. Logical Methods in Computer Science 21(4), 20 (2025). https:\/\/doi.org\/10.46298\/lmcs-21, preliminary version appeared in the proceedings of GandALF 2023. 10.4204\/EPTCS.390.12","DOI":"10.46298\/lmcs-21"},{"key":"11_CR24","doi-asserted-by":"publisher","unstructured":"Grochow, J.A., Levet, M.: On the parallel complexity of group isomorphism via Weisfeiler\u2013Leman. J. Comput. Syst. Sci. 156, 103703 (2026). https:\/\/doi.org\/10.1016\/j.jcss.2025.103703, preliminary version appeared in the proceedings of FCT 2023. 10.1007\/978-3-031-43587-4-17","DOI":"10.1016\/j.jcss.2025.103703"},{"key":"11_CR25","doi-asserted-by":"publisher","unstructured":"Grochow, J.A., Qiao, Y.: Algorithms for group isomorphism via group extensions and cohomology. SIAM J. Comput. 46(4), 1153\u20131216 (2017). https:\/\/doi.org\/10.1137\/15M1009767, preliminary version in IEEE Conference on Computational Complexity (CCC) 2014 (https:\/\/doi.org\/10.1109\/CCC.2014.19). Also available as arXiv:1309.1776 [cs.DS] and ECCC Technical Report TR13-123","DOI":"10.1137\/15M1009767"},{"key":"11_CR26","doi-asserted-by":"publisher","unstructured":"Grohe, M., Verbitsky, O.: Testing graph isomorphism in parallel by playing a game. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 3\u201314. Springer (2006). https:\/\/doi.org\/10.1007\/11786986_2","DOI":"10.1007\/11786986_2"},{"issue":"3","key":"11_CR27","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0168-0072(89)90070-5","volume":"43","author":"L Hella","year":"1989","unstructured":"Hella, L.: Definability hierarchies of generalized quantifiers. Ann. Pure Appl. Logic 43(3), 235\u2013271 (1989). https:\/\/doi.org\/10.1016\/0168-0072(89)90070-5","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"11_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1996.0070","volume":"129","author":"L Hella","year":"1996","unstructured":"Hella, L.: Logical hierarchies in PTIME. Inf. Comput. 129(1), 1\u201319 (1996). https:\/\/doi.org\/10.1006\/inco.1996.0070","journal-title":"Inf. Comput."},{"key":"11_CR29","doi-asserted-by":"publisher","unstructured":"Hou, X.d.: Finite modules over $$\\mathbb{Z}[t, t^{-1}]$$. J. Knot Theory Ramifications 21(8) (2012). https:\/\/doi.org\/10.1142\/S0218216512500794, article number 1250079, 28 pages","DOI":"10.1142\/S0218216512500794"},{"key":"11_CR30","doi-asserted-by":"publisher","unstructured":"Immerman, N., Lander, E.: Describing graphs: a first-order approach to graph canonization. In: Selman, A.L. (eds.) Complexity Theory Retrospective. Springer, New York (1990). https:\/\/doi.org\/10.1007\/978-1-4612-4478-3_5","DOI":"10.1007\/978-1-4612-4478-3_5"},{"key":"11_CR31","doi-asserted-by":"publisher","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Sys. Sci. 63(4), 512\u2013530 (2001). https:\/\/doi.org\/10.1006\/jcss.2001.1774","DOI":"10.1006\/jcss.2001.1774"},{"key":"11_CR32","unstructured":"Je\u017eek, J., Kepka, T.: Medial groupoids. Rozpravy \u010ceskoslovensk\u015b Akad. V\u011bd \u0158ada Mat. P\u0159\u00edrod. V\u011bd 93(2) (1983), 93 pages"},{"key":"11_CR33","unstructured":"Johnson, D., Levet, M., Vojt\u011bchovsk\u00fd, P., Widholm, B.: On the parallel complexity of identifying groups and quasigroups via decompositions. arXiv:2508.06478 [cs.DS] (2025)"},{"issue":"6","key":"11_CR34","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). https:\/\/doi.org\/10.1016\/j.jcss.2007.03.013","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR35","doi-asserted-by":"publisher","unstructured":"Kayal, N., Nezhmetdinov, T.: Factoring groups efficiently. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) Automata, Languages and Programming, pp. 585\u2013596. Springer, Berlin (2009). https:\/\/doi.org\/10.1007\/978-3-642-02927-1_49","DOI":"10.1007\/978-3-642-02927-1_49"},{"key":"11_CR36","unstructured":"Kepka, T., N\u011bmec, P.: T-quasigroups (Part I.). Acta Universitatis Carolinae. Mathematica et Physica 012(1), 39\u201349 (1971). http:\/\/dml.cz\/dmlcz\/142258"},{"key":"11_CR37","unstructured":"Kepka, T., N\u011bmec, P.: T-quasigroups (Part II.). Acta Universitatis Carolinae. Mathematica et Physica 012(2), 31\u201349 (1971). http:\/\/eudml.org\/doc\/246802"},{"key":"11_CR38","unstructured":"Kiefer, S.: Power and Limits of the Weisfeiler\u2013Leman Algorithm. Ph.D. thesis, RWTH Aachen University (2019). https:\/\/publications.rwth-aachen.de\/record\/785831\/files\/785831.pdf"},{"key":"11_CR39","unstructured":"Kirnasovsky, O.U.: Linear isotopes of small order groups. Quasigroups Relat. Syst. 2, 51\u201382 (1995). https:\/\/www.math.md\/en\/publications\/qrs\/issues\/v2-n1\/10462\/"},{"key":"11_CR40","doi-asserted-by":"publisher","unstructured":"K\u00f6bler, J., Sch\u00f6ning, U., Tor\u00e1n, J.: Graph isomorphism is low for PP. Comput. Complex. 2, 301\u2013330 (1992). https:\/\/doi.org\/10.1007\/BF01200427","DOI":"10.1007\/BF01200427"},{"key":"11_CR41","unstructured":"Le\u00a0Gall, F., Rosenbaum, D.J.: On the group and color isomorphism problems. arXiv:1609.08253 [cs.CC] (2016)"},{"key":"11_CR42","unstructured":"Levet, M.: On the Combinatorial and Logical Complexities of Algebraic Structures. Ph.D. thesis, University of Colorado Boulder (2023). https:\/\/colorado.idm.oclc.org\/login?url=https:\/\/www.proquest.com\/dissertations-theses\/on-combinatorial-logical-complexities-algebraic\/docview\/2814300391\/se-2"},{"key":"11_CR43","doi-asserted-by":"publisher","unstructured":"Levet, M., Rombach, P., Sieger, N.: Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler-Leman. In: Bodlaender, H.L. (ed.) 19th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2024). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0294, pp. 32:1\u201332:18. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2024). https:\/\/doi.org\/10.4230\/LIPIcs.SWAT.2024.32","DOI":"10.4230\/LIPIcs.SWAT.2024.32"},{"key":"11_CR44","doi-asserted-by":"publisher","unstructured":"Li, Y., Qiao, Y.: Linear algebraic analogues of the graph isomorphism problem and the Erd\u00f6s\u2013R\u00e9nyi model. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp. 463\u2013474 (2017). https:\/\/doi.org\/10.1109\/FOCS.2017.49","DOI":"10.1109\/FOCS.2017.49"},{"key":"11_CR45","doi-asserted-by":"publisher","unstructured":"Libkin, L.: Elements of Finite Model Theory. Springer (2004). https:\/\/doi.org\/10.1007\/978-3-662-07003-1_1","DOI":"10.1007\/978-3-662-07003-1_1"},{"key":"11_CR46","doi-asserted-by":"publisher","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, STOC 1978, pp. 51\u201358. Association for Computing Machinery, New York (1978). https:\/\/doi.org\/10.1145\/800133.804331","DOI":"10.1145\/800133.804331"},{"issue":"3","key":"11_CR47","doi-asserted-by":"publisher","first-page":"392","DOI":"10.2307\/1989940","volume":"49","author":"DC Murdoch","year":"1941","unstructured":"Murdoch, D.C.: Structure of Abelian Quasi-Groups. Trans. Am. Math. Soc. 49(3), 392\u2013409 (1941). https:\/\/doi.org\/10.2307\/1989940","journal-title":"Trans. Am. Math. Soc."},{"key":"11_CR48","doi-asserted-by":"publisher","unstructured":"Qiao, Y., Sarma, J.M.N., Tang, B.: On isomorphism testing of groups with normal Hall subgroups. In: Proc. 28th STACS, pp. 567\u2013578 (2011). https:\/\/doi.org\/10.4230\/LIPIcs.STACS.2011.567","DOI":"10.4230\/LIPIcs.STACS.2011.567"},{"key":"11_CR49","doi-asserted-by":"crossref","unstructured":"Robinson, D.: A Course in the Theory of Groups. Springer (1982)","DOI":"10.1007\/978-1-4684-0128-8"},{"issue":"3","key":"11_CR50","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1016\/0022-0000(88)90010-4","volume":"37","author":"U Sch\u00f6ning","year":"1988","unstructured":"Sch\u00f6ning, U.: Graph isomorphism is in the low hierarchy. J. Comput. Syst. Sci. 37(3), 312\u2013323 (1988). https:\/\/doi.org\/10.1016\/0022-0000(88)90010-4","journal-title":"J. Comput. Syst. Sci."},{"key":"11_CR51","doi-asserted-by":"publisher","unstructured":"Sipser, M.: Borel sets and circuit complexity. In: Johnson, D.S., et al. (eds.) Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 25-27 April 1983, Boston, Massachusetts, USA, pp. 61\u201369. ACM (1983). https:\/\/doi.org\/10.1145\/800061.808733","DOI":"10.1145\/800061.808733"},{"key":"11_CR52","doi-asserted-by":"publisher","unstructured":"Smith, J.D.H.: Mal\u2019cev Varieties. Springer, Berlin (1976). https:\/\/doi.org\/10.1007\/BFb0095447","DOI":"10.1007\/BFb0095447"},{"key":"11_CR53","unstructured":"Smith, J.D.H.: Centrality. In: O.\u00a0Chein, H.P., Smith, J. (eds.) Quasigroups and Loops: Theory and Applications, chap.\u00a0III. Heldermann, Berlin (1990)"},{"key":"11_CR54","unstructured":"Stanovsk\u00fd, D., Vojt\u011bchovsk\u00fd, P.: Central and medial quasigroups of small order. Buletinul Academiei de \u015etiin\u0163e a Republicii Moldova : Matematica 80 (11 2015), https:\/\/www.math.md\/en\/publications\/basm\/issues\/y2016-n1\/12159\/"},{"key":"11_CR55","unstructured":"Szendrei, A.: Modules in general algebra. In: Contributions to General Algebra, Proceedings of Klagenfurt Conference, vol.\u00a010, pp. 41\u201353. Verlag Johannes Heyn, Klagenfurt (1998). https:\/\/www.math.u-szeged.hu\/%7Eszendrei\/modinga.pdf"},{"key":"11_CR56","unstructured":"Tang, B.: Towards Understanding Satisfiability, Group Isomorphism and Their Connections. Ph.D. thesis, Tsinghua University (2013)"},{"issue":"7","key":"11_CR57","doi-asserted-by":"publisher","first-page":"221","DOI":"10.3792\/pia\/1195578751","volume":"17","author":"K Toyoda","year":"1941","unstructured":"Toyoda, K.: On axioms of linear functions. Proc. Imp. Acad. 17(7), 221\u2013227 (1941). https:\/\/doi.org\/10.3792\/pia\/1195578751","journal-title":"Proc. Imp. Acad."},{"key":"11_CR58","doi-asserted-by":"publisher","unstructured":"Villard, G.: Fast parallel computation of the smith normal form of polynomial matrices. In: Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC 1994, pp. 312\u2013317. Association for Computing Machinery, New York (1994). https:\/\/doi.org\/10.1145\/190347.190433","DOI":"10.1145\/190347.190433"},{"key":"11_CR59","unstructured":"Volenec, V.: Geometry of medial quasigroups. Rad Jugoslav. Akad. Znan. Umjet. 421, 79\u201391 (1986). https:\/\/web.math.pmf.unizg.hr\/~volenec\/geometrymedial.pdf"},{"key":"11_CR60","doi-asserted-by":"publisher","unstructured":"Vollmer, H.: Introduction to Circuit Complexity - A Uniform Approach. Texts in Theoretical Computer Science. An EATCS Series, Springer (1999). https:\/\/doi.org\/10.1007\/978-3-662-03927-4","DOI":"10.1007\/978-3-662-03927-4"},{"key":"11_CR61","doi-asserted-by":"publisher","unstructured":"Wilson, J.B.: Existence, algorithms, and asymptotics of direct product decompositions, I. Groups - Complexity - Cryptol. 4(1) (2012). https:\/\/doi.org\/10.1515\/gcc-2012-0007","DOI":"10.1515\/gcc-2012-0007"},{"issue":"4","key":"11_CR62","doi-asserted-by":"publisher","first-page":"1426","DOI":"10.1007\/BF02104746","volume":"29","author":"VN Zemlyachenko","year":"1985","unstructured":"Zemlyachenko, V.N., Korneenko, N.M., Tyshkevich, R.I.: Graph isomorphism problem. J. Soviet Math. 29(4), 1426\u20131481 (1985). https:\/\/doi.org\/10.1007\/BF02104746","journal-title":"J. Soviet Math."}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22469-9_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:57:31Z","timestamp":1775055451000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22469-9_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032224682","9783032224699"],"references-count":62,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22469-9_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RAMICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Relational and Algebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"B\u0119dlewo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 April 2026","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":"ramics2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ramics-conf.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}