Comparing the computational complexity of monomials and elements of finite abelian groups

DOI10.3103/S0027132222030068OpenAlexW4293752854WikidataQ114039255 ScholiaQ114039255MaRDI QIDQ2088733

Vadim V. Kochergin

Publication date: 6 October 2022

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

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

zbMATH Keywords

computational complexityfinite abelian groupaddition chainsvectorial addition chainsBellman's problemKnuth's problem

Mathematics Subject Classification ID

Abelian groups (20Kxx) Theory of computing (68Qxx) Computer science (68-XX)

Related Items (1)

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

Cites Work

• 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
• Complexity of additive computations of systems of linear forms
• On the complexity of computations on monomials and tuples of powers
• Computing Sequences with Addition Chains
• Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems
• Complexity of Linear Boolean Operators
• Remarks on number theory III. On addition chains
• Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform

This page was built for publication: Comparing the computational complexity of monomials and elements of finite abelian groups