On some measures of complexity of finite abelian groups
type: Item
instance of: scholarly article
title: On some measures of complexity of finite abelian groups
zbMATH Open document ID: 1405.20049
author: Vadim V. Kochergin
published in: Discrete Mathematics and Applications
publication date: 2017-11-02T00:00:00Z
Mathematics Subject Classification ID: 20K01
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6802431
zbMATH Keywords: finite abelian group
zbMATH Keywords: computational complexity
zbMATH Keywords: addition chains
zbMATH Keywords: vectorial addition chains
zbMATH Keywords: Bellman's problem
zbMATH Keywords: Knuth's problem
MaRDI profile type: Publication
full work available at URL: dma-2017-0010
OpenAlex ID: W2608147351
cites work: Q4301392
cites work: Q5445404
cites work: Q3208051
cites work: Q4005480
cites work: Q4301460
cites work: On the complexity of computation in finite Abelian, nilpotent and soluble groups
cites work: On the computation of powers sets
cites work: Q4888936
cites work: Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems
cites work: Q5333608
cites work: Q4517198
cites work: Regularly varying functions
cites work: Q3920642
cites work: Q5592263
cites work: Q5556574
cites work: Q3801620
cites work: Computing Sequences with Addition Chains
cites work: On vectorial addition chains
cites work: A lower bound for the length of addition chains
DOI: 10.1515/DMA-2017-0010
description: scientific article; zbMATH DE number 6802431