Pages that link to "Item:Q2548859"
From MaRDI portal
The following pages link to On multiplication of 2 \(\times\) 2 matrices (Q2548859):
Displaying 50 items.
- Fast algorithms for the basic operation of cellular methods of linear algebra (Q269130) (← links)
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank (Q304255) (← links)
- On the arithmetic complexity of Strassen-like matrix multiplications (Q346560) (← links)
- New fast hybrid matrix multiplication algorithms (Q464981) (← links)
- On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices (Q483185) (← links)
- Numerical CP decomposition of some difficult tensors (Q508007) (← links)
- Optimization techniques for small matrix multiplication (Q533859) (← links)
- On the additive complexity of 2 \(\times 2\) matrix multiplication (Q672835) (← links)
- Multiplicative complexity and algebraic structure (Q1053459) (← links)
- Typical tensorial rank (Q1064383) (← links)
- Gaussian elimination is optimal for solving linear equations in dimension two (Q1076478) (← links)
- On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping (Q1131837) (← links)
- On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication (Q1131838) (← links)
- Computational methods of linear algebra (Q1148099) (← links)
- The complexity of basic complex operations (Q1148674) (← links)
- On the algorithmic complexity of associative algebras (Q1154260) (← links)
- Using duality for the synthesis of an optimal algorithm involving matrix multiplication (Q1154261) (← links)
- A lower bound for the multiplication of polynomials modulo a polynomial (Q1197994) (← links)
- Optimum computation of p bilinear forms (Q1218902) (← links)
- On the complexity of quaternion multiplication (Q1223163) (← links)
- A survey of techniques in applied computational complexity (Q1224857) (← links)
- Untersuchungen des Zeitgewinns durch neue Algorithmen zur Matrix- Multiplikation (Q1228205) (← links)
- The complexity of vector-products (Q1243128) (← links)
- Some elementary proofs of lower bounds in complexity theory (Q1245277) (← links)
- On the optimal evaluation of a set of bilinear forms (Q1245572) (← links)
- A noncommutative algorithm for multiplying 5 X 5 matrices using 103 multiplications (Q1247162) (← links)
- Algebraic complexity of the computation of a pair of bilinear forms (Q1253698) (← links)
- Multiplicative complexity of direct sums of quadratic systems (Q1347225) (← links)
- On the complexity of the multiplication of matrices of small formats (Q1394936) (← links)
- A non-commutative cryptosystem based on quaternion algebras (Q1671643) (← links)
- The tensor rank of tensor product of two three-qubit W states is eight (Q1698581) (← links)
- Tensor rank is not multiplicative under the tensor product (Q1698592) (← links)
- Postulation of general quintuple fat point schemes in \(\mathbb P^3\) (Q1938533) (← links)
- A fast recursive algorithm for multiplying matrices of order \(n = 3^q\) \((q > 1)\) (Q2043999) (← links)
- Generation of test matrices with specified eigenvalues using floating-point arithmetic (Q2129635) (← links)
- Fast commutative matrix algorithms (Q2156374) (← links)
- An introduction to the computational complexity of matrix multiplication (Q2176822) (← links)
- On bilinear complexity of multiplying \(2 \times 2\)-matrix by \(2 \times m\)-matrix over finite field (Q2191009) (← links)
- New ways to multiply \(3 \times 3\)-matrices (Q2229749) (← links)
- Trisymmetric multiplication formulae in finite fields (Q2232213) (← links)
- A new fast recursive matrix multiplication algorithm (Q2281348) (← links)
- Computing images of polynomial maps (Q2305553) (← links)
- Progress on the symmetric Strassen conjecture (Q2341528) (← links)
- A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices (Q2354472) (← links)
- Tensor surgery and tensor rank (Q2422765) (← links)
- Rank-profile revealing Gaussian elimination and the CUP matrix decomposition (Q2437224) (← links)
- On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication (Q2444860) (← links)
- Fast hybrid matrix multiplication algorithms (Q2452754) (← links)
- Fast matrix decomposition in \(\mathbb F_2\) (Q2511223) (← links)
- The bilinear complexity and practical algorithms for matrix multiplication (Q2940335) (← links)
