On some measures of complexity of finite abelian groups (Q1675532): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1515/dma-2017-0010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2608147351 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4301392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5445404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3208051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4005480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4301460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of computation in finite Abelian, nilpotent and soluble groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computation of powers sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvement of the estimates of the computational complexity for monomials and sets of powers in Bellman’s and Knuth’s problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5333608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularly varying functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3920642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5556574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3801620 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Sequences with Addition Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: On vectorial addition chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the length of addition chains / rank
 
Normal rank

Latest revision as of 16:33, 14 July 2024

scientific article
Language Label Description Also known as
English
On some measures of complexity of finite abelian groups
scientific article

    Statements

    On some measures of complexity of finite abelian groups (English)
    0 references
    0 references
    0 references
    2 November 2017
    0 references
    0 references
    finite abelian group
    0 references
    computational complexity
    0 references
    addition chains
    0 references
    vectorial addition chains
    0 references
    Bellman's problem
    0 references
    Knuth's problem
    0 references
    0 references