On the computation complexity of the systems of finite abelian group elements

DOI10.3103/s0027132223040034OpenAlexW4388377237MaRDI QIDQ6154999

Vadim V. Kochergin

Publication date: 16 February 2024

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0027132223040034

zbMATH Keywords

computational complexityfinite abelian groupaddition chainsvectorial addition chain

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Finite abelian groups (20K01)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On some measures of complexity of finite abelian groups
• On Bellman's and Knuth's problems and their generalizations
• Comparing the computational complexity of monomials and elements of finite abelian groups
• On the Evaluation of Powers and Monomials
• On the Evaluation of Powers
• Complexity of Linear Boolean Operators
• Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform

This page was built for publication: On the computation complexity of the systems of finite abelian group elements