scientific article; zbMATH DE number 3461412

Direct numerical methods for linear systems and matrix inversion (65F05) Numerical linear algebra (65F99) Analysis of algorithms and problem complexity (68Q25)

Cited in

(only showing first 100 items - show all)

Maximal bilinear complexity and codes
Algebraic complexities and algebraic curves over finite fields
On bilinear complexity of multiplication of \(m\times 2\) and \(2\times 2\) matrices
On the direct sum conjecture
Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
A very personal reminiscence on the problem of computational complexity
A parametric representation of totally mixed Nash equilibria
Characterizing propositional proofs as noncommutative formulas
The complexity of vector-products
Tensor rank: matching polynomials and Schur rings
Computing multihomogeneous resultants using straight-line programs
On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping
Fast exact algorithms using Hadamard product of polynomials
\(\mathrm P \overset {?} {=} \mathrm{NP}\)
On the order of approximation in approximative triadic decompositions of tensors
A super-quadratic lower bound for depth four arithmetic circuits
The complexity of bivariate power series arithmetic.
Semialgebraic proofs, IPS lower bounds, and the \(\tau\)-conjecture: can a natural number be negative?
Feasible arithmetic computations: Valiant's hypothesis
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Short Proofs for the Determinant Identities
The trace invariant and matrix inversion
Some computational problems in linear algebra as hard as matrix multiplication
Efficient Black-Box Identity Testing for Free Group Algebras
On the complexities of multipoint evaluation and interpolation
Numerical stability and tensor nuclear norm
Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication
On the direct sum conjecture in the straight line model
Tensors in computations
Lower bounds for polynomial evaluation and interpolation problems
Fast matrix multiplication and its algebraic neighbourhood
scientific article; zbMATH DE number 7387190 (Why is no real title available?)
Communication complexity of multi-processor systems
A note on VNP-completeness and border complexity
Border Rank Nonadditivity for Higher Order Tensors
Lower bounds for diophantine approximations
The complexity of partial derivatives
Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits
On semiring complexity of Schur polynomials
On the algorithmic complexity of associative algebras
Global properties of tensor rank
Subrank and optimal reduction of scalar multiplications to generic tensors
Progress on the symmetric Strassen conjecture
Generalizing Frobenius inversion to quaternion matrices
Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
Strassen's rank additivity for small tensors, including tensors of rank less or equal 7
Ranks of tensors and a generalization of secant varieties
Rank of a tensor and quantum entanglement
Operator scaling: theory and applications
Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
Faster combinatorial algorithms for determinant and Pfaffian
Faster polynomial multiplication via discrete Fourier transforms
The Hitchhiker guide to: secant varieties and tensor decomposition
Evaluation properties of invariant polynomials
Straight-line programs in geometric elimination theory
Group-theoretic lower bounds for the complexity of matrix multiplication
Commutative algebras of minimal rank
On Comon's and Strassen's conjectures
Fast and efficient parallel solution of dense linear systems
The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations
On computing reciprocals of power series
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
The complexity of basic complex operations
Deformation techniques for efficient polynomial equation solving.
Computing the sign or the value of the determinant of an integer matrix, a complexity survey.
Fast structured matrix computations: tensor rank and Cohn-Umans method
Negation can be exponentially powerful
Faster Combinatorial Algorithms for Determinant and Pfaffian
Graph-theoretic properties in computational complexity
Lower bounds in algebraic computational complexity
On the optimal evaluation of a set of bilinear forms
The lower bounds on the additive complexity of bilinear problems in terms of some algebraic quantities
Lower bounds for polynomials with algebraic coefficients
New combinations of methods for the acceleration of matrix multiplication
Homogeneous formulas and symmetric polynomials
On sets of linear forms of maximal complexity
Bounds on the tensor rank
Abelian tensors
The communication complexity of enumeration, elimination, and selection
A lower bound for polynomial multiplication
Geometric conditions for strict submultiplicativity of rank and border rank
Semialgebraic geometry of nonnegative tensor rank
A note on the simultaneous Waring rank of monomials
A survey of techniques in applied computational complexity
On the algebraic complexity of some families of coloured Tutte polynomials
On the maximal multiplicative complexity of a family of bilinear forms
Non-commutative circuits and the sum-of-squares problem
On the number of multiplications needed to invert a monic power series over fields of characteristic two
The G-stable rank for tensors and the cap set problem
On a class of primary algebras of minimal rank
Invariant and geometric aspects of algebraic complexity theory. I
scientific article; zbMATH DE number 7561740 (Why is no real title available?)
Base tensorielle des matrices de Hankel (ou de Toeplitz). Applications
Grothendieck constant is norm of Strassen matrix multiplication tensor
On Strassen's rank additivity for small three-way tensors
The quadratic hull of a code and the geometric view on multiplication algorithms
Typical tensorial rank
Boolean circuits versus arithmetic circuits
Multiplicative complexity of direct sums of quadratic systems
Bounds on the ranks of some 3-tensors

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4047029)