scientific article; zbMATH DE number 3162280
From MaRDI portal
Publication:3280357
Recommendations
- A polynomial problem
- scientific article; zbMATH DE number 3846866
- Some problems on polynomial approximation
- On a problem in the theory of polynomials
- Some topics in the arithmetic of polynomials
- Some extremal problems of polynomials
- scientific article; zbMATH DE number 859917
- scientific article; zbMATH DE number 125031
- scientific article; zbMATH DE number 3886493
Cited in
(13)- 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
- Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials
- Lower bound for the approximative complexity
- On the conditioning of polynomial and rational forms
- Evaluating polynomials at many points
- The evaluation of polynomials
- On Kolmogorov complexity in the real Turing machine setting
- Low-Order Approximations for the Normal Probability Integral and the Error Function
- Fast matrix multiplication and its algebraic neighbourhood
- A new method to obtain lower bounds for polynomial evaluation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3280357)
