scientific article; zbMATH DE number 3408906
From MaRDI portal
Publication:5674406
zbMath0258.68024MaRDI QIDQ5674406
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Numerical methods for trigonometric approximation and interpolation (65T40) Direct numerical methods for linear systems and matrix inversion (65F05) Algorithms in computer science (68W99)
Related Items (13)
Fast parallel polynomial division via reduction to triangular Toeplitz matrix inversion and to polynomial inversion modulo a power ⋮ Complexity bounds for solving some tridiagonal systems with preconditioning ⋮ Multiplicative complexity of direct sums of quadratic systems ⋮ Some fast algorithms multiplying a matrix by its adjoint ⋮ Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication ⋮ Dual problems of multiplication of a vector by a matrix ⋮ Fast modular transforms ⋮ On the complexity of quaternion multiplication ⋮ Some elementary proofs of lower bounds in complexity theory ⋮ On the optimal evaluation of a set of bilinear forms ⋮ Global properties of tensor rank ⋮ On the multiplicative complexity of the discrete Fourier transform ⋮ Evaluating polynomials at many points
This page was built for publication:
