Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes
springer
摘要
We design a linear time algorithm to factor Hamiltonian groups. This allows us to obtain an \(\mathcal {O}(n)\) algorithm for the isomorphism problem of Hamiltonian groups, where n is the order of the groups.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要