Sequential and parallel algorithms for symbolic computation of integer powers of sparse polynomials
Main Author: | Probst, D. K |
---|---|
Format: | Others |
Published: |
1977
|
Online Access: | http://spectrum.library.concordia.ca/4195/1/MK34714.pdf Probst, D. K <http://spectrum.library.concordia.ca/view/creators/Probst=3AD=2E_K=3A=3A.html> (1977) Sequential and parallel algorithms for symbolic computation of integer powers of sparse polynomials. Masters thesis, Concordia University. |
Similar Items
- Polynomials that are integer valued on the image of an integer-valued polynomial
-
Computing sparse multiples of polynomials
by: Tilak, Hrushikesh
Published: (2010) -
Computing sparse multiples of polynomials
by: Tilak, Hrushikesh
Published: (2010) -
Efficient Computation with Sparse and Dense Polynomials
by: Roche, Daniel Steven
Published: (2011) -
Efficient Computation with Sparse and Dense Polynomials
by: Roche, Daniel Steven
Published: (2011)