On the hensel lifting method of computing the GCD of two univariate polynomials over the integers
Saved in:
Main Author: | Md. Said, Junaida |
---|---|
Format: | Thesis |
Published: |
2005
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/34908/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Numerical matrix methods in the computation of the greatest common divisor (GCD) of polynomials
by: Isa, S. N. A. B., et al.
Published: (2016) -
Analysis and comparison of numerical algorithms for finding the GCD of certain types of polynomials in the Chebyshev basis
by: Isa, S. N. A., et al.
Published: (2017) -
GCD attack on the LUC4 cryptosystem.
by: Wong, Tze Jin, et al.
Published: (2009) -
On the lagrange-burmann theorem and the generating relations for orthogonal polynomials
by: Mohd. Safuan, Hamizah
Published: (2005) -
A binary integer programming model for multi-resource leveling problem
by: Bodaghi, Behrooz
Published: (2012)