The evaluation of determinants by expansion by minors and the general problem of substitution
W. Morven Gentleman, S. C. Johnson · Mathematics of Computation · 1974
In this paper, we consider a class of substitution strategies which correspond to various minor expansion algorithms, and show that the usual expansion by minors, a row at a time, is optimal in this class.