The following pages link to (Q3280357):
Displaying 13 items.
- On Kolmogorov complexity in the real Turing machine setting (Q293323) (← links)
- Bilinear mincing rank (Q1115593) (← links)
- Lower bounds for polynomials with algebraic coefficients (Q1148670) (← links)
- On the additive complexity of polynomials (Q1157163) (← links)
- The lower bounds on the additive complexity of bilinear problems in terms of some algebraic quantities (Q1157165) (← links)
- Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials (Q1249939) (← links)
- Lower bound for the approximative complexity (Q1822498) (← links)
- On the conditioning of polynomial and rational forms (Q2522175) (← links)
- Evaluating polynomials at many points (Q2549230) (← links)
- The evaluation of polynomials (Q2625737) (← links)
- Low-Order Approximations for the Normal Probability Integral and the Error Function (Q4064941) (← links)
- Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
- A new method to obtain lower bounds for polynomial evaluation (Q5941294) (← links)
