On the computation complexity of the systems of finite abelian group elements (Q6154999): Difference between revisions

The reviewed paper investigates the computation complexity of the systems of the finite abelian group elements. The complexity of computation means the minimal number of group operations required to calculate elements of the system over the basis elements, all results of intermediate calculations may be used multiple times. In addition, the asymptotics of the maximal possible difference of computation complexity of the systems of finite abelian group elements and the computation complexity of a monomial system corresponding to the representation of these elements over basis elements is obtained under the same conditions. In fact, the author successfully makes that in a series of statements such as Theorems 1 and 2. To achieve the proofs, a few preliminary technicalities were established like Lemmas 1 and 2 needed for the proof of Theorem 1, as well as Lemma 3 needed for the proof of Theorem 2. However, concrete examples of finite abelian groups possessing the given calculations are unfortunately unprovided in the text, as normally the procedure requires.