6 citations · 6 across the 6 of their papers we have counts for
1 paper · 1 filter
Hugo Daniel Macedo
It is widely known that the lower bound for the algorithmic complexity of square matrix multiplication resorts to at least n2 arithmetic operations. The justification builds upo…