On some measures of complexity of finite abelian groups

DOI10.1515/dma-2017-0010zbMath1405.20049OpenAlexW2608147351MaRDI QIDQ1675532

Vadim V. Kochergin

Publication date: 2 November 2017

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma-2017-0010

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items

On the computation complexity of the systems of finite abelian group elements, Comparing the computational complexity of monomials and elements of finite abelian groups

Cites Work

• A lower bound for the length of addition chains
• On the computation of powers sets
• Computing Sequences with Addition Chains
• On vectorial addition chains
• On the complexity of computation in finite Abelian, nilpotent and soluble groups
• Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems
• Regularly varying functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item