Login | Register

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.

[thumbnail of MK34714.pdf]
Preview
Text (application/pdf)
MK34714.pdf
18MB

Divisions:Concordia University > Gina Cody School 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:M. Comp. Sc.
Program:Computer Science and Software Engineering
Date:1977
Identification Number:QA 155.7 E4P7X
ID Code:4195
Deposited By: Concordia University Library
Deposited On:27 Aug 2009 19:37
Last Modified:13 Jul 2020 19:56
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

Downloads per month over past year

Research related to the current document (at the CORE website)
- Research related to the current document (at the CORE website)
Back to top Back to top