Publication:4047029
From MaRDI portal
zbMath0294.65021MaRDI QIDQ4047029
Publication date: 1973
Full work available at URL: https://www.digizeitschriften.de/dms/resolveppn/?PPN=GDZPPN00218866X
68Q25: Analysis of algorithms and problem complexity
65F05: Direct numerical methods for linear systems and matrix inversion
65F99: Numerical linear algebra
Related Items
Faster Combinatorial Algorithms for Determinant and Pfaffian, Algebraic complexities and algebraic curves over finite fields, The communication complexity of enumeration, elimination, and selection, Commutative algebras of minimal rank, Deformation techniques to solve generalised Pham systems, Some computational problems in linear algebra as hard as matrix multiplication, On the complexities of multipoint evaluation and interpolation, Evaluation properties of invariant polynomials, On the maximal multiplicative complexity of a family of bilinear forms, On commutativity and approximation, The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations, On the direct sum conjecture, Faster combinatorial algorithms for determinant and Pfaffian, Rank and optimal computation of generic tensors, Lower bounds in algebraic computational complexity, On a class of primary algebras of minimal rank, Typical tensorial rank, Border rank of m\(\times n\times (mn-q)\) tensors, Irreducibility of multivariate polynomials, A lower bound for polynomial multiplication, A very personal reminiscence on the problem of computational complexity, The trace invariant and matrix inversion, Feasible arithmetic computations: Valiant's hypothesis, Communication complexity of multi-processor systems, On the order of approximation in approximative triadic decompositions of tensors, On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping, Bounds on the ranks of some 3-tensors, Negation can be exponentially powerful, Lower bounds for polynomials with algebraic coefficients, The complexity of basic complex operations, On the algorithmic complexity of associative algebras, New combinations of methods for the acceleration of matrix multiplication, The lower bounds on the additive complexity of bilinear problems in terms of some algebraic quantities, Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication, Division in idealized unit cost RAMs, Computing multivariate polynomials in parallel, Fast matrix multiplication without APA-algorithms, The complexity of partial derivatives, Invariant and geometric aspects of algebraic complexity theory. I, The multiplicative complexity of quadratic boolean forms, Test complexity of generic polynomials, Base tensorielle des matrices de Hankel (ou de Toeplitz). Applications, On the complexity of quaternion multiplication, A method for calculating the reciprocal coefficients of function matrices, A survey of techniques in applied computational complexity, Graph-theoretic properties in computational complexity, Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics, The complexity of vector-products, 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 direct sum conjecture in the straight line model, Multiplicative complexity of direct sums of quadratic systems, Lower bounds for diophantine approximations, Parallel evaluation of arithmetic circuits, Straight-line programs in geometric elimination theory, Lower bounds for polynomial evaluation and interpolation problems, The complexity of bivariate power series arithmetic., Computing the sign or the value of the determinant of an integer matrix, a complexity survey., On the algebraic complexity of some families of coloured Tutte polynomials, Effective equidimensional decomposition of affine varieties, Beyond the Alder-Strassen bound., Fast and efficient parallel solution of dense linear systems, Functional programming concepts and straight-line programs in computer algebra, High-order lifting and integrality certification, Deformation techniques for efficient polynomial equation solving., On computing reciprocals of power series, On the number of multiplications needed to invert a monic power series over fields of characteristic two, Computing multihomogeneous resultants using straight-line programs, Real roots of univariate polynomials and straight line programs, Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten, Berechnung und Programm. I, Maximal bilinear complexity and codes, Boolean circuits versus arithmetic circuits
