Pages that link to "Item:Q1143788"
From MaRDI portal
The following pages link to Some polynomials that are hard to compute (Q1143788):
Displaying 5 items.
- On Kolmogorov complexity in the real Turing machine setting (Q293323) (← 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)
- A new method to obtain lower bounds for polynomial evaluation (Q5941294) (← links)