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)

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 n (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
On semiring complexity of Schur polynomials
Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits
On Comon's and Strassen's conjectures
A note on the simultaneous Waring rank of monomials
Sparse resultants and straight-line programs
Multiplicative complexity of vector valued Boolean functions
Fast structured matrix computations: tensor rank and Cohn-Umans method
Bounds on the tensor rank
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
Ranks of tensors and a generalization of secant varieties
Block tensors and symmetric embeddings
Deformation techniques for efficient polynomial equation solving.
Tensor slice rank and Cayley's first hyperdeterminant
A note on VNP-completeness and border complexity
Quadratic lower bounds for algebraic branching programs and formulas
The G-stable rank for tensors and the cap set problem
On computing reciprocals of power series
Operator scaling: theory and applications
Grothendieck constant is norm of Strassen matrix multiplication tensor
The Hitchhiker guide to: secant varieties and tensor decomposition
Progress on the symmetric Strassen conjecture
On the number of multiplications needed to invert a monic power series over fields of characteristic two
Abelian tensors
P-RAM vs. RP-RAM
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
Geometric conditions for strict submultiplicativity of rank and border rank
On sets of linear forms of maximal complexity
Algebraic complexity classes
\(\mathrm P \overset {?} {=} \mathrm{NP}\)
Semialgebraic geometry of nonnegative tensor rank
Faster polynomial multiplication via discrete Fourier transforms
Group-theoretic lower bounds for the complexity of matrix multiplication
Categorical complexity
Tensor rank: matching polynomials and Schur rings
Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
Characterizing propositional proofs as noncommutative formulas
Fast matrix multiplication and its algebraic neighbourhood
Border Rank Nonadditivity for Higher Order Tensors
scientific article; zbMATH DE number 7387190 (Why is no real title available?)
scientific article; zbMATH DE number 7471587 (Why is no real title available?)
The quadratic hull of a code and the geometric view on multiplication algorithms
Determinant: Old algorithms, new insights
A quadratic lower bound for algebraic branching programs
scientific article; zbMATH DE number 7561740 (Why is no real title available?)

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)