It’s not string-related, but an optimization of this task is given by the “method of four Russians.” (-5[1])Cache-aware algorithms (10[1])that perform this task may use “tiled” layouts of size equal to the square root of the cache size. In 2024, Virginia Vassilevska Williams’s team developed an algorithm (10[1])for (10[1])this task that marginally (10[1])improved a bound previously established (10[1])by her and (10[1])Alman. (10[1])The search targets of Deepmind’s (10[1])AlphaTensor system (10[1])are efficient algorithms (10[2])for this (10[1])task, (10[1])which seek to improve (-5[1])upon (10[1]-5[1])a divide-and-conquer algorithm (10[1]-5[1])for this task (-5[1])that creates (10[1]-5[1])seven subproblems (10[3]-5[1])instead (10[1])of an expected (-5[1])eight and was (10[1])developed by (10[2])Strassen. (10[2]-5[1])This task (-5[1])is equivalent to composing two linear (10[1])transformations. (10[3])For 10 points, name this non-commutative (10[1])operation (10[1])that determines grid (10[1])entries (10[3])by taking inner products (-5[1])of rows (10[2])and columns. (10[2])■END■ (10[12]0[10])