A polyalgorithm for polynomial GCD computation involving matrices
As GCD computation surfaces as a subproblem in a variety of applications, the need for some way to discriminate between algorithms according to performance becomes apparent. In this study, a polyalgorithm for polynomial GCD computation was developed. Algorithms involving Sylvester, Bezout, and Hanke...
Saved in:
Main Author: | Parrilla, Nonna J. |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
2014
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_masteral/4615 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |
Similar Items
-
Pythia: A polyalgorithm oracle for factoring integers
by: Que, Jemie L.
Published: (2007) -
Multi-exponentiation algorithm based on binary GCD computation and its application to side-channel countermeasure
by: Yen, Sung-Ming, et al.
Published: (2014) -
On polynomial equations and circulant matrices
by: Ramos, Robby Ricky A.
Published: (2006) -
Hermitian matrices of roots of unity and their characteristic polynomials
by: Greaves, Gary Royden Watson, et al.
Published: (2023) -
On the vector space of a-like matrices for tadpole graphs
by: Gillesania, Chester James Kent I., et al.
Published: (2016)