Computational complexity of computing polynomials over the fields of real and complex numbers (Q5402553): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 20:29, 5 March 2024

scientific article; zbMATH DE number 6270114
Language Label Description Also known as
English
Computational complexity of computing polynomials over the fields of real and complex numbers
scientific article; zbMATH DE number 6270114

    Statements

    Computational complexity of computing polynomials over the fields of real and complex numbers (English)
    0 references
    0 references
    14 March 2014
    0 references
    complexity of computation
    0 references
    evaluation
    0 references
    lower bounds of complexity
    0 references
    number of arithmetic operations
    0 references
    optimal schemes of computation
    0 references
    polynomial
    0 references
    preconditioning
    0 references
    scheme of computation
    0 references
    upper bounds of complexity
    0 references

    Identifiers

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