Using an efficient sparse minor expansion algorithm to compute polynomial subresultants and GCD.
Download or Read eBook Using an efficient sparse minor expansion algorithm to compute polynomial subresultants and GCD. PDF written by University of Utah. Dept. of Computer Science and published by . This book was released on 1977 with total page 32 pages. Available in PDF, EPUB and Kindle.
Author | : University of Utah. Dept. of Computer Science |
Publisher | : |
Total Pages | : 32 |
Release | : 1977 |
ISBN-10 | : OCLC:71376558 |
ISBN-13 | : |
Rating | : 4/5 (58 Downloads) |
Book Synopsis Using an efficient sparse minor expansion algorithm to compute polynomial subresultants and GCD. by : University of Utah. Dept. of Computer Science
Book excerpt: