On Isomorphism Testing of Groups with Normal Hall Subgroups-Reference-Cited by-同舟云学术

On Isomorphism Testing of Groups with Normal Hall Subgroups

Published:2012-07 Issue:4 Volume:27 Page:687-701
ISSN:1000-9000
Container-title:Journal of Computer Science and Technology
language:en
Short-container-title:J. Comput. Sci. Technol.

Author:

Qiao You-Ming,M.N. Jayalal Sarma,Tang Bang-Sheng

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Computer Science Applications,Hardware and Architecture,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s11390-012-1255-7.pdf

Reference34 articles.

1. Dehn M. Über unendliche diskontinuierliche gruppen. Mathematische Annalen, 1911, 71: 116–144.

2. Adian S. The unsolvability of certain algorithmic problems in the theory of groups. Trudy Moskov. Math. Obshch, 1957, 6: 231–298.

3. Babai L, Szemerédi E. On the complexity of matrix group problems i. In Proc. IEEE Annual Symposium on Foundations of Computer Science (FOCS), West Palm Beach, Florida, USA, October 24–26, 1984, pp.229–240.

4. Köbler J, Schöning U, Torán J. The Graph Isomorphism Problem: Its Structural Complexity. Boston: Birkhauser, 1993.

5. Chattopadhyay A, Torán J, Wagner F. Graph isomorphism is not AC 0 reducible to group isomorphism. In Proc. Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010), Chennai, India, Dec. 15–18, 2010, pp.317–326.

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

1. Linear Space Data Structures for Finite Groups with Constant Query-Time;Algorithmica;2024-03-11

2. Faster Isomorphism for -Groups of Class 2 and Exponent;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

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

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

5. Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes;Computer Science – Theory and Applications;2019