Lower bound for the approximative complexity
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.
scientific article; zbMATH DE number 4003519