NASA Logo

NTRS

NTRS - NASA Technical Reports Server

Collections About News Help Login
Back to Results
Computing time analyses for some arithmetic and algebraic algorithmsDeriving computing time bounds for polynomial reduced sequence algorithm for computing greatest common divisor of two polynomials with integer coefficients
Document ID
19710009721
Acquisition Source
Legacy CDMS
Document Type
Other
Authors
Collins, G. E. (Wisconsin Univ. Madison, WI, United States)
Date Acquired
August 6, 2013
Publication Date
June 1, 1969
Publication Information
Publication: IBM PROC. OF THE 1968 SUMMER INST. ON SYMBOLIC MATHEMATICAL COMPUTATION JUN. 1969
Subject Category
Mathematics
Accession Number
71N19196
Funding Number(s)
CONTRACT_GRANT: NSF GJ-239
Distribution Limits
Public
Copyright
Work of the US Gov. Public Use Permitted.

Available Downloads

There are no available downloads for this record.

Related Records

IDRelationTitleCollected Works19710009710Collected WorksProceedings of the 1968 Summer Institute on Symbolic Mathematical ComputationN71-19185 08-19Collected Works19710009710Collected WorksProceedings of the 1968 Summer Institute on Symbolic Mathematical Computation
No Preview Available