New lower bounds on tensor rank of matrix multiplication with GPT-6 AstraResearch Paper
Every fast matrix multiplication algorithm starts from an identity that computes a fixed-shape product with few multiplications. Strassen's 1969 algorithm (Str69) multiplies two matrices with 7 instead of 8 multiplications, and applying such an identity recursively turns multiplications for a by product into an …