The multiplicative complexity of certain semilinear systems defined by polynomials (Q786509): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Some bilinear forms whose multiplicative complexity depends on the field of constants / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the multiplicative complexity of the discrete Fourier transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4401564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5601777 / rank
 
Normal rank

Latest revision as of 10:29, 14 June 2024

scientific article
Language Label Description Also known as
English
The multiplicative complexity of certain semilinear systems defined by polynomials
scientific article

    Statements

    The multiplicative complexity of certain semilinear systems defined by polynomials (English)
    0 references
    0 references
    0 references
    1980
    0 references
    semilinear systems defined by polynomials
    0 references
    minimal algorithm
    0 references
    multiplicative complexity
    0 references
    simple arithmetic operations
    0 references
    steps of arithmetic operations
    0 references

    Identifiers

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