An efficient sparse minor expansion algorithm

Publisher Website
Google Scholar
Abstract
An improved algorithm for computing the minors of a (large) sparse matrix of polynomials is described, with emphasis on efficiency and optimal ordering. A possible application to polynomial resultant computation is discussed.