Pages that link to "Item:Q1249939"
From MaRDI portal
The following pages link to Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials (Q1249939):
Displayed 10 items.
- On Kolmogorov complexity in the real Turing machine setting (Q293323) (← links)
- A note on the complexity of approximative evaluation of polynomials (Q599498) (← links)
- Some polynomials that are hard to compute (Q1143788) (← links)
- Lower bounds for polynomials with algebraic coefficients (Q1148670) (← links)
- On the additive complexity of polynomials (Q1157163) (← links)
- Simplified lower bounds for polynomials with algebraic coefficients (Q1361874) (← links)
- On the representation of rational functions of bounded complexity (Q1822978) (← links)
- Time-space tradeoffs in algebraic complexity theory (Q1977138) (← links)
- On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant (Q2514144) (← links)
- A new method to obtain lower bounds for polynomial evaluation (Q5941294) (← links)