Comparing the computational complexity of monomials and elements of finite abelian groups
type: Item
instance of: scholarly article
title: Comparing the computational complexity of monomials and elements of finite abelian groups
DOI: 10.3103/S0027132222030068
published in: Moscow University Mathematics Bulletin
publication date: 2022-10-06T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
Mathematics Subject Classification ID: 20Kxx
Mathematics Subject Classification ID: 68-XX
zbMATH DE Number: 7596803
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
Wikidata QID: Q114039255
author: Vadim V. Kochergin
MaRDI profile type: Publication
cites work: Q4301460
cites work: Computing Sequences with Addition Chains
cites work: Q4005480
cites work: On some measures of complexity of finite abelian groups
cites work: Complexity of additive computations of systems of linear forms
cites work: Q5585021
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: On Bellman's and Knuth's problems and their generalizations
cites work: Complexity of Linear Boolean Operators
cites work: Q4301392
cites work: Remarks on number theory III. On addition chains
cites work: Q5672822
cites work: On the complexity of computations on monomials and tuples of powers
cites work: Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform
full work available at URL: s0027132222030068
OpenAlex ID: W4293752854
description: scientific article; zbMATH DE number 7596803