scientific article

zbMath0099.33001MaRDI QIDQ3280357

Edouard G. Belaga

Publication date: 1958

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

numerical analysis

Mathematics Subject Classification ID

Numerical computation of solutions to single equations (65H05)

Related Items (13)

On Kolmogorov complexity in the real Turing machine setting ⋮ The evaluation of polynomials ⋮ Bilinear mincing rank ⋮ Lower bounds for polynomials with algebraic coefficients ⋮ On the additive complexity of polynomials ⋮ The lower bounds on the additive complexity of bilinear problems in terms of some algebraic quantities ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ A new method to obtain lower bounds for polynomial evaluation ⋮ Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials ⋮ On the conditioning of polynomial and rational forms ⋮ Low-Order Approximations for the Normal Probability Integral and the Error Function ⋮ Lower bound for the approximative complexity ⋮ Evaluating polynomials at many points

This page was built for publication: