Lower bound for the approximative complexity (Q1822498)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Lower bound for the approximative complexity
scientific article

    Statements

    Lower bound for the approximative complexity (English)
    0 references
    0 references
    1986
    0 references
    We generalize several methods for obtaining lower bounds for the complexity of polynomials, such as those based on substitution, transcendence degree or algebraic geometric degree, to the approximate model.
    0 references
    0 references
    0 references
    0 references
    0 references
    lower bounds
    0 references
    complexity of polynomials
    0 references
    0 references