common divisor
Hardware Implementation of Greatest Common Divisor using subtractor in Euclid Algorithm
5
A non-linear structure-preserving matrix method for the computation of the coefficients of an approximate greatest common divisor of two Bernstein polynomials
38
Nearest common root of polynomials, approximate greatest common divisor and the structured singular value
20
Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials
23
Approximate greatest common divisor of many polynomials and pseudo-spectrum
7
The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials
39
Revisiting Orthogonal Lattice Attacks on Approximate Common Divisor Problems and their Applications
28
Singular value decomposition and structures total least norm for approximate greatest common divisor of unvariate polynomials
24
On Greatest Common Divisor and its Application for a Geometrical Structure
5
Chapter-04slide.ppt
51
The Fermat S-Prime Meet Matrices and Reciprocal Fermat S-Prime Meet Matrices on Posets
10
Computing Approximation GCD of Several Polynomials by Structured Total Least Norm
8
One-prime power hypothesis for conjugacy class sizes
7
The Cyclic Decomposition of the Factor Group cf(Q2m×D5,Z) /R ¯(Q2m×D5) when m = p, p?2, is prime number
12
On bipartite divisor graph for character degrees
7
Numerical and Symbolical Methods for the GCD of Several Polynomials
29
Sum Square Prime Labeling for Some Path Related Graphs
5
Vol 9, No 2 (2018)
6
A note on Cubic Difference Prime Labeling
8
The k Zero Divisor Hypergraph of a Commutative Ring
15