Rankings
Publications
Search Publications
Cited-By Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Login
Register
Home
Publications
An efficient sparse minor expansion algorithm
Home
Publications
An efficient sparse minor expansion algorithm
An efficient sparse minor expansion algorithm
Martin L. Griss
Martin L. Griss
Publisher Website
Google Scholar
Add to library
Cite
Download
Share
Download
1 January 1976
proceedings article
Published by
Association for Computing Machinery (ACM)
p.
429-434
https://doi.org/10.1145/800191.805633
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.
All Articles
Open Access
Cited by 2 articles