The following pages link to (Q4047029):
Displaying 50 items.
- Tensor rank: matching polynomials and Schur rings (Q404298) (← links)
- Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method (Q432769) (← links)
- Sufficient conditions for Strassen's additivity conjecture (Q512483) (← links)
- Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation (Q540327) (← links)
- Commutative algebras of minimal rank (Q595370) (← links)
- Deformation techniques to solve generalised Pham systems (Q598226) (← links)
- Homogeneous formulas and symmetric polynomials (Q649096) (← links)
- Some computational problems in linear algebra as hard as matrix multiplication (Q685718) (← links)
- On the complexities of multipoint evaluation and interpolation (Q706626) (← links)
- Evaluation properties of invariant polynomials (Q731933) (← links)
- On the maximal multiplicative complexity of a family of bilinear forms (Q754639) (← links)
- On commutativity and approximation (Q799369) (← links)
- The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations (Q800727) (← links)
- On the direct sum conjecture (Q801142) (← links)
- Fast exact algorithms using Hadamard product of polynomials (Q832524) (← links)
- Faster combinatorial algorithms for determinant and Pfaffian (Q848938) (← links)
- A parametric representation of totally mixed Nash equilibria (Q979929) (← links)
- Rank and optimal computation of generic tensors (Q1051066) (← links)
- Lower bounds in algebraic computational complexity (Q1057648) (← links)
- On a class of primary algebras of minimal rank (Q1063670) (← links)
- Typical tensorial rank (Q1064383) (← links)
- Border rank of m\(\times n\times (mn-q)\) tensors (Q1079634) (← links)
- Irreducibility of multivariate polynomials (Q1083191) (← links)
- A lower bound for polynomial multiplication (Q1086218) (← links)
- A very personal reminiscence on the problem of computational complexity (Q1091818) (← links)
- The trace invariant and matrix inversion (Q1105373) (← links)
- Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)
- Communication complexity of multi-processor systems (Q1118403) (← links)
- On the order of approximation in approximative triadic decompositions of tensors (Q1123957) (← links)
- On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping (Q1131837) (← links)
- Bounds on the ranks of some 3-tensors (Q1138616) (← links)
- Negation can be exponentially powerful (Q1143790) (← links)
- Lower bounds for polynomials with algebraic coefficients (Q1148670) (← links)
- The complexity of basic complex operations (Q1148674) (← links)
- On the algorithmic complexity of associative algebras (Q1154260) (← links)
- New combinations of methods for the acceleration of matrix multiplication (Q1154805) (← links)
- The lower bounds on the additive complexity of bilinear problems in terms of some algebraic quantities (Q1157165) (← links)
- Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication (Q1158927) (← links)
- Division in idealized unit cost RAMs (Q1159982) (← links)
- Computing multivariate polynomials in parallel (Q1166928) (← links)
- Fast matrix multiplication without APA-algorithms (Q1168050) (← links)
- The complexity of partial derivatives (Q1171380) (← links)
- Invariant and geometric aspects of algebraic complexity theory. I (Q1176389) (← links)
- The multiplicative complexity of quadratic boolean forms (Q1199694) (← links)
- Test complexity of generic polynomials (Q1201154) (← links)
- Base tensorielle des matrices de Hankel (ou de Toeplitz). Applications (Q1211341) (← links)
- On the complexity of quaternion multiplication (Q1223163) (← links)
- A method for calculating the reciprocal coefficients of function matrices (Q1224410) (← links)
- A survey of techniques in applied computational complexity (Q1224857) (← links)
- Graph-theoretic properties in computational complexity (Q1236886) (← links)