{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T08:22:38Z","timestamp":1758702158049,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,7,16]],"date-time":"2024-07-16T00:00:00Z","timestamp":1721088000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"NSF","award":["CISE-204775"],"award-info":[{"award-number":["CISE-204775"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,7,16]]},"DOI":"10.1145\/3666000.3669691","type":"proceedings-article","created":{"date-parts":[[2024,7,15]],"date-time":"2024-07-15T13:18:51Z","timestamp":1721049531000},"page":"198-207","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Constant Depth Circuit Complexity for Generating Quasigroups"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2694-4080","authenticated-orcid":false,"given":"Nathaniel A.","family":"Collins","sequence":"first","affiliation":[{"name":"Colorado State University, Department of Mathematics, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6466-0476","authenticated-orcid":false,"given":"Joshua A.","family":"Grochow","sequence":"additional","affiliation":[{"name":"University of Colorado Boulder, Departments of Computer Science and Mathematics, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-1992-3175","authenticated-orcid":false,"given":"Michael","family":"Levet","sequence":"additional","affiliation":[{"name":"College of Charleston, Department of Computer Science, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7645-5867","authenticated-orcid":false,"given":"Armin","family":"Wei\u00df","sequence":"additional","affiliation":[{"name":"Universit\u00e4t Stuttgart, FMI, Germany"}]}],"member":"320","published-online":{"date-parts":[[2024,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/11940128_25"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103461"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/0209018"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897542"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1984.715919"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","unstructured":"D.A.M. Barrington. 1992. Quasipolynomial size circuit classes. In [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference. 86\u201393. https:\/\/doi.org\/10.1109\/SCT.1992.215383","DOI":"10.1109\/SCT.1992.215383"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.2001.1764"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(91)90017-V"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01263421"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2540088"},{"volume-title":"The theory of nilpotent groups","author":"Clement E.","key":"e_1_3_2_1_11_1","unstructured":"Anthony\u00a0E. Clement, Stephen Majewicz, and Marcos Zyman. 2017. The theory of nilpotent groups. Birkh\u00e4user\/Springer, Cham. xvii+307 pages."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"Nathaniel\u00a0A. Collins Joshua\u00a0A. Grochow Michael Levet and Armin Wei\u00df. 2024. On the Constant-Depth Circuit Complexity of Generating Quasigroups. arXiv:2402.00133 [cs.CC].","DOI":"10.46298\/theoretics.25.19"},{"key":"e_1_3_2_1_13_1","unstructured":"Bireswar Das and Dhara Thakkar. 2023. Algorithms for the Minimum Generating Set Problem. arxiv:2305.08405\u00a0[math.GR]"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.STACS.2022.26"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00053"},{"volume-title":"Foundations of Information and Knowledge Systems","author":"Ferrarotti Flavio","key":"e_1_3_2_1_16_1","unstructured":"Flavio Ferrarotti, Sen\u00e9n Gonz\u00e1lez, Klaus-Dieter Schewe, and Jos\u00e9\u00a0Mar\u00eda Turull-Torres. 2020. Proper Hierarchies in Polylogarithmic Time and Absence of Complete Problems. In Foundations of Information and Knowledge Systems, Andreas Herzig and Juha Kontinen (Eds.). Springer International Publishing, Cham, 90\u2013105."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2022.v018a008"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-43587-4_17"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1009767"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","unstructured":"Harald\u00a0Andr\u00e9s Helfgott Jitendra Bajpai and Daniele Dona. 2017. Graph isomorphisms in quasi-polynomial time. https:\/\/doi.org\/10.48550\/ARXIV.1710.04574","DOI":"10.48550\/ARXIV.1710.04574"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510018"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/J.JSC.2023.02.002"},{"key":"e_1_3_2_1_23_1","unstructured":"Emil Jer\u00e1bek. 2020. Answer to \u201cIs Abelian group isomorphism in Math 302?\u201d. Theoretical Computer Science Stack Exchange. https:\/\/cstheory.stackexchange.com\/q\/40118 (version: 2020-06-17)."},{"key":"e_1_3_2_1_24_1","unstructured":"Fran\u00e7ois Le\u00a0Gall and David\u00a0J. Rosenbaum. 2016. On the Group and Color Isomorphism Problems. arXiv:1609.08253 [cs.CC]."},{"key":"e_1_3_2_1_25_1","first-page":"41","article-title":"On the Complexity of Identifying Strongly Regular Graphs","volume":"87","author":"Levet Michael","year":"2023","unstructured":"Michael Levet. 2023. On the Complexity of Identifying Strongly Regular Graphs. Australasian Journal of Combinatorics 87 (2023), 41\u201367. https:\/\/ajc.maths.uq.edu.au\/pdf\/87\/ajc_v87_p041.pdf","journal-title":"Australasian Journal of Combinatorics"},{"key":"e_1_3_2_1_26_1","unstructured":"R.\u00a0J. Lipton L. Snyder and Y. Zalcstein. 1977. The Complexity of Word and Isomorphism Problems for Finite Groups. Yale University Dept. of Computer Science Research Report # 91. https:\/\/apps.dtic.mil\/dtic\/tr\/fulltext\/u2\/a053246.pdf"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1994.1027"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2023.11.012"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804331"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01222774"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1006\/JCSS.1996.0058"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1093\/oso\/9780198536901.003.0012"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391289.1391291"},{"volume-title":"A Course in the Theory of Groups","author":"Robinson D.","key":"e_1_3_2_1_34_1","unstructured":"D. Robinson. 1982. A Course in the Theory of Groups. Springer."},{"key":"e_1_3_2_1_35_1","unstructured":"David\u00a0J. Rosenbaum. 2013. Bidirectional Collision Detection and Faster Deterministic Isomorphism Testing. arXiv:1304.3935 [cs.DS]."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59141-9"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28404"},{"volume-title":"Towards Understanding Satisfiability, Group Isomorphism and Their Connections. Ph.\u00a0D. Dissertation","author":"Tang Bangsheng","key":"e_1_3_2_1_38_1","unstructured":"Bangsheng Tang. 2013. Towards Understanding Satisfiability, Group Isomorphism and Their Connections. Ph.\u00a0D. Dissertation. Tsinghua University. http:\/\/papakonstantinou.org\/periklis\/pdfs\/bangsheng_thesis.pdf"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1017\/S030500410002987X"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970241096X"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03927-4"},{"key":"e_1_3_2_1_42_1","unstructured":"F. Wagner. 2010. On the complexity of isomorphism testing for restricted classes of graphs. Ph.\u00a0D. Dissertation. Universit\u00e4t Ulm. https:\/\/oparu.uni-ulm.de\/xmlui\/bitstream\/handle\/123456789\/3923\/vts_7264_10267.pdf"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)00014-I"}],"event":{"name":"ISSAC '24: International Symposium on Symbolic and Algebraic Computation","sponsor":["SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Raleigh NC USA","acronym":"ISSAC '24"},"container-title":["Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3666000.3669691","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3666000.3669691","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:53:53Z","timestamp":1758588833000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3666000.3669691"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,16]]},"references-count":43,"alternative-id":["10.1145\/3666000.3669691","10.1145\/3666000"],"URL":"https:\/\/doi.org\/10.1145\/3666000.3669691","relation":{},"subject":[],"published":{"date-parts":[[2024,7,16]]},"assertion":[{"value":"2024-07-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}