Author:
Das Bireswar,Sharma Shivdutt
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference26 articles.
1. Arvind, V., Torán, J: Solvable group isomorphism is (almost) in NP ∩ coNP. ACM Transactions on Computation Theory 2(2), 4:1–4:22 (2011)
2. Babai, L., Qiao, Y.: Polynomial-time isomorphism test for groups with abelian sylow towers. In: STACS’12 (29th Symposium on theoretical aspects of computer science), 14, pp 453–464, LIPIcs (2012)
3. Babai, L., Codenotti, P., Qiao, Y.: Polynomial-time isomorphism test for groups with no abelian normal subgroups - (extended abstract). In: Automata, languages, and programming - 39th international colloquium, ICALP 2012, warwick, uk, july 9-13, 2012, proceedings, part I, pp 51–62 (2012), https://doi.org/10.1007/978-3-642-31594-7_5
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, Oxford (1937)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Count-free Weisfeiler–Leman and group isomorphism;International Journal of Algebra and Computation;2024-04-03
2. On the Descriptive Complexity of Groups without Abelian Normal Subgroups (Extended Abstract);Electronic Proceedings in Theoretical Computer Science;2023-09-30
3. Group isomorphism is nearly-linear time for most orders;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02