摘要：This paper makes a comparative study between Bernoulli distribution inputs and Geometric distribution inputs in Amir Schoor's matrix multiplication algorithm. For fixed order of the square matrices, the average number of multiplications is found to increase and decrease linearly with increasing probability of success for Bernoulli and Geometric inputs respectively. Given the opposite nature of these two probability distributions, the commonality of linearity confirms the robustness of the algorithm.
