Author:
Karagiorgos Gregory,Poulakis Dimitrios
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Beynon, W.M., Iliopoulos, C.S.: Computing a basis for a finite abelian p-group. Information Processing Letters 20, 161–163 (1985)
2. Lecture Notes in Computer Science;M. Borges-Quintana,2005
3. Buchmann, J., Schmidt, A.: Computing the structure of a finite abelian group. Mathematics of Computation 74, 2017–2026 (2005)
4. Chen, L.: Algorithms and their complexity analysis for some problems in finite group. Journal of Sandong Normal University 2, 27–33 (1984) (in Chinese)
5. Chen, L., Fu, B.: Linear Sublinear Time Algorithms for the Basis of Abelian groups. Theoretical Computer Science (2010), doi:10.1016/j.tcs.2010.06.011
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Group isomorphism is nearly-linear time for most orders;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
2. Isomorphism testing of groups of cube-free order;Journal of Algebra;2020-03
3. EFFICIENT ALGORITHMS FOR THE BASIS OF FINITE ABELIAN GROUPS;Discrete Mathematics, Algorithms and Applications;2011-12
4. Linear Time Algorithms for the Basis of Abelian Groups;Lecture Notes in Computer Science;2011