Content deleted Content added
m →Cache behavior: {{sfrac}} |
mNo edit summary |
||
Line 25:
</div>
This algorithms takes [[time complexity|time]] {{math|Θ(''nmp'')}} (in [[asymptotic notation]]).<ref name="skiena"/> A common simplification for the purpose of [[analysis of algorithms|algorithms analysis]] is to assume that the inputs are all square matrices of size {{math|''n'' × ''n''}}, in which case the running time is {{math|Θ(''n''<sup>3</sup>)}}, i.e., cubic.<ref name="clrs">{{Introduction to Algorithms|3|pages=75–79}}</ref>
===Cache behavior===
| |||