scientific article
From MaRDI portal
zbMath0294.65021MaRDI QIDQ4047029
Publication date: 1973
Full work available at URL: https://www.digizeitschriften.de/dms/resolveppn/?PPN=GDZPPN00218866X
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical linear algebra (65F99)
Related Items
Tensors in computations, Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring, The quadratic hull of a code and the geometric view on multiplication algorithms, Determinant: Old algorithms, new insights, Characterizing Propositional Proofs as Noncommutative Formulas, Unnamed Item, On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions, Numerical stability and tensor nuclear norm, Unnamed Item, Fast matrix multiplication and its algebraic neighbourhood, Unnamed Item, Faster Combinatorial Algorithms for Determinant and Pfaffian, Efficient Black-Box Identity Testing for Free Group Algebras, CATEGORICAL COMPLEXITY, Faster Polynomial Multiplication via Discrete Fourier Transforms, Group-Theoretic Lower Bounds for the Complexity of Matrix Multiplication, Algebraic complexities and algebraic curves over finite fields, Unnamed Item, The communication complexity of enumeration, elimination, and selection, Subtraction-free complexity, cluster transformations, and spanning trees, Non-commutative circuits and the sum-of-squares problem, On Strassen's Rank Additivity for Small Three-way Tensors, Algebraic Complexity Classes, A quadratic lower bound for algebraic branching programs, A super-quadratic lower bound for depth four arithmetic circuits, $$P\mathop{ =}\limits^{?}NP$$, Border Rank Nonadditivity for Higher Order Tensors, Semialgebraic Geometry of Nonnegative Tensor Rank, Short Proofs for the Determinant Identities, A note on VNP-completeness and border complexity, Border rank of m\(\times n\times (mn-q)\) tensors, High-order lifting and integrality certification, Irreducibility of multivariate polynomials, A lower bound for polynomial multiplication, Fast exact algorithms using Hadamard product of polynomials, On semiring complexity of Schur polynomials, Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits, A very personal reminiscence on the problem of computational complexity, On Comon's and Strassen's conjectures, Multiplicative complexity of direct sums of quadratic systems, Faster combinatorial algorithms for determinant and Pfaffian, Maximal bilinear complexity and codes, Boolean circuits versus arithmetic circuits, Lower bounds for diophantine approximations, On the number of multiplications needed to invert a monic power series over fields of characteristic two, The trace invariant and matrix inversion, Quadratic lower bounds for algebraic branching programs and formulas, Parallel evaluation of arithmetic circuits, Feasible arithmetic computations: Valiant's hypothesis, Abelian tensors, The \(G\)-stable rank for tensors and the cap set problem, Commutative algebras of minimal rank, Communication complexity of multi-processor systems, P-RAM vs. RP-RAM, Deformation techniques to solve generalised Pham systems, A note on the simultaneous Waring rank of monomials, Geometric conditions for strict submultiplicativity of rank and border rank, Straight-line programs in geometric elimination theory, On the order of approximation in approximative triadic decompositions of tensors, Lower bounds for polynomial evaluation and interpolation problems, On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping, Ranks of tensors and a generalization of secant varieties, Block tensors and symmetric embeddings, Bounds on the ranks of some 3-tensors, Tensor rank: matching polynomials and Schur rings, On sets of linear forms of maximal complexity, Sparse resultants and straight-line programs, Negation can be exponentially powerful, The complexity of bivariate power series arithmetic., Lower bounds for polynomials with algebraic coefficients, The complexity of basic complex operations, On the algorithmic complexity of associative algebras, Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method, New combinations of methods for the acceleration of matrix multiplication, Multiplicative complexity of vector valued Boolean functions, Fast structured matrix computations: tensor rank and Cohn-Umans method, 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 the sign or the value of the determinant of an integer matrix, a complexity survey., Homogeneous formulas and symmetric polynomials, Computing multivariate polynomials in parallel, Fast matrix multiplication without APA-algorithms, The complexity of partial derivatives, On the algebraic complexity of some families of coloured Tutte polynomials, Invariant and geometric aspects of algebraic complexity theory. I, Computing multihomogeneous resultants using straight-line programs, Deformation techniques for efficient polynomial equation solving., Real roots of univariate polynomials and straight line programs, Sufficient conditions for Strassen's additivity conjecture, Some computational problems in linear algebra as hard as matrix multiplication, The multiplicative complexity of quadratic boolean forms, Test complexity of generic polynomials, Bounds on the tensor rank, Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation, Base tensorielle des matrices de Hankel (ou de Toeplitz). Applications, On computing reciprocals of power series, On the complexities of multipoint evaluation and interpolation, Beyond the Alder-Strassen bound., On the complexity of quaternion multiplication, A parametric representation of totally mixed Nash equilibria, 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, Evaluation properties of invariant polynomials, Global properties of tensor rank, On the direct sum conjecture in the straight line model, On the maximal multiplicative complexity of a family of bilinear forms, Operator scaling: theory and applications, Fast and efficient parallel solution of dense linear systems, Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten, Berechnung und Programm. I, Rank and optimal computation of generic tensors, Grothendieck constant is norm of Strassen matrix multiplication tensor, The Hitchhiker guide to: secant varieties and tensor decomposition, Tensor slice rank and Cayley's first hyperdeterminant, Functional programming concepts and straight-line programs in computer algebra, Lower bounds in algebraic computational complexity, Progress on the symmetric Strassen conjecture, 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, On a class of primary algebras of minimal rank, Typical tensorial rank, Effective equidimensional decomposition of affine varieties
