Comparing the computational complexity of monomials and elements of finite abelian groups (Q2088733): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Vadim V. Kochergin / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q114039255 / rank
 
Normal rank
Property / author
 
Property / author: Vadim V. Kochergin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4301460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Sequences with Addition Chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4005480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some measures of complexity of finite abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of additive computations of systems of linear forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585021 / 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: On Bellman's and Knuth's problems and their generalizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Linear Boolean Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4301392 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on number theory III. On addition chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5672822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of computations on monomials and tuples of powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on a Lower Bound on the Linear Complexity of the Fast Fourier Transform / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3103/s0027132222030068 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4293752854 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:04, 30 July 2024

scientific article
Language Label Description Also known as
English
Comparing the computational complexity of monomials and elements of finite abelian groups
scientific article

    Statements

    Comparing the computational complexity of monomials and elements of finite abelian groups (English)
    0 references
    6 October 2022
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references