scientific article; zbMATH DE number 3461412

zbMATH Open0294.65021MaRDI QIDQ4047029FDOQ4047029

Publication date: 1973

Full work available at URL: https://www.digizeitschriften.de/dms/resolveppn/?PPN=GDZPPN00218866X

Title of this publication is not available (Why is that?)

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)

On the direct sum conjecture
Characterizing propositional proofs as noncommutative formulas
Three-way arrays: rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics
A parametric representation of totally mixed Nash equilibria
Computing multihomogeneous resultants using straight-line programs
Tensor rank: matching polynomials and Schur rings
\(\mathrm P \overset {?} {=} \mathrm{NP}\)
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
On the order of approximation in approximative triadic decompositions of tensors
Feasible arithmetic computations: Valiant's hypothesis
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
The trace invariant and matrix inversion
Some computational problems in linear algebra as hard as matrix multiplication
Tensors in computations
On the complexities of multipoint evaluation and interpolation
Fast matrix multiplication and its algebraic neighbourhood
Title not available (Why is that?)
Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication
Lower bounds for polynomial evaluation and interpolation problems
Lower bounds for diophantine approximations
The complexity of partial derivatives
On the algorithmic complexity of associative algebras
Global properties of tensor rank
Progress on the symmetric Strassen conjecture
Ranks of tensors and a generalization of secant varieties
Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method
Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
Faster polynomial multiplication via discrete Fourier transforms
Faster combinatorial algorithms for determinant and Pfaffian
The Hitchhiker guide to: secant varieties and tensor decomposition
Straight-line programs in geometric elimination theory
Evaluation properties of invariant polynomials
Commutative algebras of minimal rank
On Comon's and Strassen's conjectures
Fast and efficient parallel solution of dense linear systems
On computing reciprocals of power series
The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix 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
Graph-theoretic properties in computational complexity
Lower bounds in algebraic computational complexity
On the optimal evaluation of a set of bilinear forms
On sets of linear forms of maximal complexity
Lower bounds for polynomials with algebraic coefficients
The communication complexity of enumeration, elimination, and selection
New combinations of methods for the acceleration of matrix multiplication
Homogeneous formulas and symmetric polynomials
Bounds on the tensor rank
A lower bound for polynomial multiplication
On the algebraic complexity of some families of coloured Tutte polynomials
Non-commutative circuits and the sum-of-squares problem
On the maximal multiplicative complexity of a family of bilinear forms
Base tensorielle des matrices de Hankel (ou de Toeplitz). Applications
Boolean circuits versus arithmetic circuits
Typical tensorial rank
Beyond the Alder-Strassen bound.
Bounds on the ranks of some 3-tensors
Categorical complexity
Multiplicative complexity of vector valued Boolean functions
Division in idealized unit cost RAMs
Algebraic complexity classes
Berechnung und Programm. I
Deformation techniques to solve generalised Pham systems
Subtraction-free complexity, cluster transformations, and spanning trees
On commutativity and approximation
High-order lifting and integrality certification
Irreducibility of multivariate polynomials
On the Size of Depth-Three Boolean Circuits for Computing Multilinear Functions
Sufficient conditions for Strassen's additivity conjecture
Effective equidimensional decomposition of affine varieties
Rank and optimal computation of generic tensors
Functional programming concepts and straight-line programs in computer algebra
Fast matrix multiplication without APA-algorithms
Block tensors and symmetric embeddings
Some elementary proofs of lower bounds in complexity theory
Real roots of univariate polynomials and straight line programs
Algebraic complexities and algebraic curves over finite fields
The multiplicative complexity of quadratic boolean forms
On bilinear complexity of multiplication of \(m\times 2\) and \(2\times 2\) matrices
Maximal bilinear complexity and codes
A very personal reminiscence on the problem of computational complexity
The complexity of vector-products
A super-quadratic lower bound for depth four arithmetic circuits
Semialgebraic proofs, IPS lower bounds, and the \(\tau\)-conjecture: can a natural number be negative?
Short Proofs for the Determinant Identities
The complexity of bivariate power series arithmetic.
Efficient Black-Box Identity Testing for Free Group Algebras
Numerical stability and tensor nuclear norm
On the direct sum conjecture in the straight line model
Communication complexity of multi-processor systems
A note on VNP-completeness and border complexity
Border Rank Nonadditivity for Higher Order Tensors
Subrank and optimal reduction of scalar multiplications to generic tensors
Generalizing Frobenius inversion to quaternion matrices
Strassen's rank additivity for small tensors, including tensors of rank less or equal 7
Rank of a tensor and quantum entanglement
Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits

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)