Lower bounds for polynomial evaluation and interpolation problems (Q1386175): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on matrix rigidity / 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 / cites work
 
Property / cites work: Q4047029 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten / rank
 
Normal rank

Latest revision as of 11:33, 28 May 2024

scientific article
Language Label Description Also known as
English
Lower bounds for polynomial evaluation and interpolation problems
scientific article

    Statements

    Lower bounds for polynomial evaluation and interpolation problems (English)
    0 references
    0 references
    0 references
    20 September 1998
    0 references
    polynomial evaluation
    0 references
    arithmetic circuits
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references