Breadcrumb

 
 

Sequential and parallel algorithms for symbolic computation of integer powers of sparse polynomials

Title:

Sequential and parallel algorithms for symbolic computation of integer powers of sparse polynomials

Probst, D. K (1977) Sequential and parallel algorithms for symbolic computation of integer powers of sparse polynomials. Masters thesis, Concordia University.

[img]
Preview
PDF
17Mb

Divisions:Concordia University > Faculty of Engineering and Computer Science > Computer Science and Software Engineering
Item Type:Thesis (Masters)
Authors:Probst, D. K
Pagination:x, 142 leaves : ill., graphs ; 28 cm.
Institution:Concordia University
Degree Name:Theses (M.Comp.Sc.)
Program:Computer Science and Software Engineering
Date:1977
ID Code:4195
Deposited By:Concordia University Libraries
Deposited On:27 Aug 2009 15:37
Last Modified:08 Dec 2010 10:37
Related URLs:
All items in Spectrum are protected by copyright, with all rights reserved. The use of items is governed by Spectrum's terms of access.

Repository Staff Only: item control page

Document Downloads

More statistics for this item...

Concordia University - Footer