The evaluation of determinants by expansion by minors and the general problem of substitution
Abstract: 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.
Retrieve articles in Mathematics of Computation with MSC: 68A20
Retrieve articles in all journals with MSC: 68A20
Keywords: Substitution, expansion by minors, determinants
Article copyright: © Copyright 1974 American Mathematical Society