Talk:Determinant and permanent: Difference between revisions

 

::: I think some of these "differences of algorithm" would go away if we thought of multiplication as being a short circuit operator (that could prune entire recursive call trees when one of the values being multiplied was zero). Another thing that might help would be re-expressing the algorithm using something other than a "sequence over time loop" to organize the recursive expansion of minors (or at least: allowing rephrasings which ignore the limitations of ieee floating point. That said, a little focus on re-expressing using equivalencies (and searching for likely zeros) does seem like a good subject when dealing with alternative algorithms.. --[[User:Rdm|Rdm]] 13:29, 30 July 2012 (UTC)