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.
- © Copyright 1974 American Mathematical Society
- Journal: Math. Comp. 28 (1974), 543-548
- MSC: Primary 68A20
- DOI: https://doi.org/10.1090/S0025-5718-1974-0373369-7
- MathSciNet review: 0373369