Pages that link to "Item:Q4085178"

The following pages link to A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications (Q4085178):

Displaying 28 items.

• Fast algorithms for the basic operation of cellular methods of linear algebra (Q269130) (← links)
• New fast hybrid matrix multiplication algorithms (Q464981) (← links)
• New cellular methods for matrix multiplication (Q465910) (← links)
• A unified cellular method for matrix multiplication (Q465980) (← 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)
• The trace invariant and matrix inversion (Q1105373) (← links)
• A noncommutative algorithm for multiplying 5 X 5 matrices using 103 multiplications (Q1247162) (← links)
• On the complexity of the multiplication of matrices of small formats (Q1394936) (← links)
• An ultrafast cellular method for matrix multiplication (Q1735313) (← links)
• The geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matrices (Q1739162) (← links)
• Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25 (Q1789204) (← links)
• A fast recursive algorithm for multiplying matrices of order \(n = 3^q\) \((q > 1)\) (Q2043999) (← links)
• Equivalent polyadic decompositions of matrix multiplication tensors (Q2074879) (← links)
• Fast commutative matrix algorithms (Q2156374) (← links)
• Compressible FHE with applications to PIR (Q2175949) (← 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)
• Improved method for finding optimal formulas for bilinear maps in a finite field (Q2272384) (← links)
• A new fast recursive matrix multiplication algorithm (Q2281348) (← links)
• A bilinear algorithm of length \(22\) for approximate multiplication of \(2\times 7\) and \(7\times 2\) matrices (Q2354472) (← links)
• On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication (Q2444860) (← links)
• The bilinear complexity and practical algorithms for matrix multiplication (Q2940335) (← links)
• Tensor Rank is Hard to Approximate (Q5009520) (← links)
• Pebbling Game and Alternative Basis for High Performance Matrix Multiplication (Q6087745) (← links)
• Recursive cellular methods of matrix multiplication (Q6115822) (← links)