Comparing the Computational Complexity of Monomials and Elements of Finite Abelian Groups
V. V. Kochergin · Moscow University Mathematics Bulletin · 2022
The computational complexity of the element $$a_{1}^{k_{1}}a_{2}^{k_{2}}\ldots a_{q}^{k_{q}}$$ of the Abelian group $$\langle a_{1}\rangle_{u_{1}}\times\langle a_{2}\rangle_{u_{2}}\times\ldots$$ $$\ldots\times\langle a_{q}\rangle_{u_{q}}$$ (it is supposed that $$k_{i}