Assertion: algorithm | /r/CapableOf | process all 2n2 entries
Facets:
Source sentences:
text: Since any algorithm for multiplying two n × n-matrices has to process all 2n2 entries, there is an asymptotic lower bound of Ω(n2) operations.