Question

It’s not string-related, but an optimization of this task is given by the “method of four Russians.” Cache-aware algorithms 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 for this task that marginally improved a bound previously established by her and Alman. The search targets of Deepmind’s AlphaTensor system are efficient algorithms for this (10[1])task, which seek to improve upon a divide-and-conquer algorithm for this task that creates seven subproblems instead of an expected eight and was developed by Strassen. This task is equivalent to composing two linear transformations. (10[1])For 10 points, name this non-commutative operation that determines grid entries by taking inner products of rows and columns. (10[1])■END■ (0[2])

ANSWER: matrix multiplication [accept descriptions of multiplying matrices; reject “multiplication” or “scalar multiplication”]
<Maryland A, Other Science>
= Average correct buzz position

Back to tossups

Buzzes

PlayerTeamOpponentBuzz PositionValue
Rohan DalalGeorgia Tech CAlabama A7210
Matthew SumanenGeorgia Tech BBruin A10710
Parker McCoigTennessee AGeorgia Tech D12610
Beckett GilmoreLouisville AVanderbilt A1270
James ZhaoVanderbilt ALouisville A1270

Summary

California2025-02-01Y3100%0%0%70.00
Great Lakes2025-02-01Y580%0%20%110.00
Lower Mid-Atlantic2025-02-01Y667%0%67%114.50
Midwest2025-02-01Y683%0%33%98.00
North2025-02-01Y3100%0%0%100.33
Overflow2025-02-01Y5100%0%0%99.00
Pacific Northwest2025-02-01Y2100%0%50%86.50
South Central2025-02-01Y2100%0%50%104.50
Southeast2025-02-01Y475%0%0%101.67
UK2025-02-01Y1090%0%20%106.33
Upper Mid-Atlantic2025-02-01Y8100%0%0%74.63
Upstate NY2025-02-01Y3100%0%0%117.00