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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback