The complexity of partial derivatives (Q1171380): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Extension of Strassen’s Degree Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gaussian elimination is not optimal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Berechnung und Programm. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4047029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3929052 / rank
 
Normal rank

Latest revision as of 17:23, 13 June 2024

scientific article
Language Label Description Also known as
English
The complexity of partial derivatives
scientific article

    Statements

    The complexity of partial derivatives (English)
    0 references
    0 references
    0 references
    1983
    0 references
    0 references
    0 references
    0 references
    0 references
    complexity of single power sums
    0 references
    single elementary symmetric functions
    0 references
    root functions
    0 references
    matrix inversion
    0 references
    determinant
    0 references