The following pages link to (Q5560620):
Displaying 12 items.
- Polynomial evaluation over finite fields: new algorithms and complexity bounds (Q694568) (← links)
- Lower bounds in algebraic computational complexity (Q1057648) (← links)
- A very personal reminiscence on the problem of computational complexity (Q1091818) (← links)
- Fast modular transforms (Q1216049) (← links)
- A survey of techniques in applied computational complexity (Q1224857) (← links)
- Solution of two problems of linear algebra on a parallel SIMD system (Q1580215) (← links)
- The faster methods for computing Bessel functions of the first kind of an integer order with application to graphic processors (Q2284244) (← links)
- Abelian tensors (Q2398420) (← links)
- Evaluating polynomials at many points (Q2549230) (← links)
- On the evaluation of some sparse polynomials (Q4600715) (← links)
- Fast matrix multiplication and its algebraic neighbourhood (Q4610195) (← links)
- On evaluating multivariate polynomials over finite fields (Q5233898) (← links)
