On the maximal complexity of calculations of systems of elements of a free Abelian groupстатья
Информация о цитировании статьи получена из
Scopus
Статья опубликована в журнале из списка Web of Science и/или Scopus
Дата последнего поиска статьи во внешних источниках: 28 мая 2015 г.
Аннотация:The problem of the complexity of joint calculation of a system of elements of a free Abelian
group is studied in the paper and a model admitting multiple usage of intermediate calculation results
is chosen for simulation. A growth asymptotics for the value $L_F(p,q,K)$ is obtained under weak restrictions;
this value is the minimal number of multiplication operations sufficient for calculation of an
arbitrary system of p elements of a free Abelian group (based on q generators and elements of this group
inverse to them) possessing the property that in a representation of the elements via the generators all
degrees do not exceed $K−1$ in absolute value.