On the number of multiplications necessary to compute certain functions
From MaRDI portal
Publication:5584925
DOI10.1002/cpa.3160230204zbMath0191.15804OpenAlexW2026405063WikidataQ114237995 ScholiaQ114237995MaRDI QIDQ5584925
Publication date: 1970
Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/cpa.3160230204
Related Items
Gaussian elimination is optimal for solving linear equations in dimension two, Bounds on certain multiplications of affine combinations, A lower bound for polynomial multiplication, A very personal reminiscence on the problem of computational complexity, Logic minimization techniques with applications to cryptology, Multiplicative complexity of direct sums of quadratic systems, A short proof for the open quadrant problem, Weight enumerators of codes derived from polynomial product algorithms, Some basic information on information-based complexity theory, Semi-algebraic complexity -- Additive complexity of matrix computational tasks, Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. I: The algebra \(G[u/<Q(u)^{\ell}>\), \(\ell >1\)], Une extension du théorème de Winograd, The complexity of basic complex operations, New combinations of methods for the acceleration of matrix multiplication, On the additive complexity of polynomials, Direct sums of bilinear algorithms, On the efficiency of some combined methods for polynomial complex zeros, Fast matrix multiplication and its algebraic neighbourhood, The computational complexity of a set of quadratic functions, Dual problems of multiplication of a vector by a matrix, Computing lower bounds on tensor rank over finite fields, Fast methods for resumming matrix polynomials and Chebyshev matrix polynomials., On the complexity of multiplication in finite fields, Invariant and geometric aspects of algebraic complexity theory. I, Some Results on Sparse Matrices, On the multiplication of reduced biquaternions and applications, Verification complexity of linear prime ideals, Auswertungsverfahren für Polynome in mehreren Variablen, Fast modular transforms, The Mailman algorithm: a note on matrix-vector multiplication, Some bilinear forms whose multiplicative complexity depends on the field of constants, A survey of techniques in applied computational complexity, Commutativity, non-commutativity, and bilinearity, The complexity of vector-products, Evaluation of polynomials with super-preconditioning, Some elementary proofs of lower bounds in complexity theory, On the optimal evaluation of a set of bilinear forms, Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials, Non-commutative circuits and the sum-of-squares problem, Algebraic complexity of the computation of a pair of bilinear forms, On the optimal computation of a set of symmetric and persymmetric bilinear forms, On the multiplicative complexity of the discrete Fourier transform, On the number of active *-operations needed to compute the discrete Fourier transform, Lower bound for the approximative complexity, Evaluating polynomials at many points, Berechnung und Programm. I, Is computing with the finite Fourier transform pure or applied mathematics?, Lower bounds in algebraic computational complexity, Lower bounds for dynamic algebraic problems, On commutativity and approximation
