scientific article; zbMATH DE number 3276110
From MaRDI portal
Publication:5560620
zbMath0173.17802MaRDI QIDQ5560620
Publication date: 1966
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (12)
A very personal reminiscence on the problem of computational complexity ⋮ Abelian tensors ⋮ On the evaluation of some sparse polynomials ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ Polynomial evaluation over finite fields: new algorithms and complexity bounds ⋮ Fast modular transforms ⋮ A survey of techniques in applied computational complexity ⋮ The faster methods for computing Bessel functions of the first kind of an integer order with application to graphic processors ⋮ Evaluating polynomials at many points ⋮ On evaluating multivariate polynomials over finite fields ⋮ Solution of two problems of linear algebra on a parallel SIMD system ⋮ Lower bounds in algebraic computational complexity
This page was built for publication:
