Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes-Reference-Cited by-同舟云学术

Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes

Published:2019 Issue: Volume: Page:80-92
ISSN:0302-9743
Container-title:Computer Science – Theory and Applications
language:
Short-container-title:

Author:

Das Bireswar,Sharma Shivdutt

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-19955-5_8

Reference20 articles.

1. Arvind, V., Torán, J.: Solvable group isomorphism is (almost) in NP $$\cap $$ ∩ coNP. ACM Trans. Comput. Theory 2(2), 4:1–4:22 (2011)

2. Lecture Notes in Computer Science;L Babai,2012

3. Babai, L., Qiao, Y.: Polynomial-time isomorphism test for groups with abelian sylow towers. In: STACS 2012 (29th Symposium on Theoretical Aspects of Computer Science), vol. 14, pp. 453–464. LIPIcs (2012)

4. Boppana, R.B., Hastad, J., Zachos, S.: Does co-NP have short interactive proofs? Inf. Process. Lett. 25(2), 127–132 (1987)

5. Carmichael, R.D.: Introduction to the Theory of Groups of Finite Order. GINN and Company, Boston (1937)

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Count-free Weisfeiler–Leman and group isomorphism;International Journal of Algebra and Computation;2024-04-03

2. On the Parallel Complexity of Group Isomorphism via Weisfeiler–Leman;Fundamentals of Computation Theory;2023

3. Compact Data Structures for Dedekind Groups and Finite Rings;WALCOM: Algorithms and Computation;2021

4. Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes;Theory of Computing Systems;2020-10-21

5. On the Weisfeiler-Leman Dimension of Finite Groups;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08