Pages that link to "Item:Q5941294"
From MaRDI portal
The following pages link to A new method to obtain lower bounds for polynomial evaluation (Q5941294):
Displaying 5 items.
- Complexity lower bounds for computation trees with elementary transcendental function gates (Q1365876) (← links)
- Time-space tradeoffs in algebraic complexity theory (Q1977138) (← links)
- Fast computation of the \(N\)-th term of a \(q\)-holonomic sequence and applications (Q2674000) (← links)
- Combinatorial proofs for transcendency of formal power series. (Q2759224) (← links)
- (Q4464663) (← links)