This algorithms takes [[time complexity|time]] {{math|Θ(''nmp'')}} (in [[asymptotic notation]]),.<ref name="skiena"/> orA {{math|Θ(''n''<sup>3</sup>)}}common insimplification for the casepurpose of square[[analysis matrices,of algorithms|algorithms analysis]] is to assume that the inputs are all square matrices of shapesize {{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|75–79}}</ref>
