ISSAC
2005
Springer
14 years 5 months ago
2005
Springer
Over the past few decades several variations on a “half GCD” algorithm for obtaining the pair of terms in the middle of a Euclidean sequence have been proposed. In the integer...
ISSAC
2005
Springer
14 years 5 months ago
2005
Springer
Let G = (4y2 + 2z)x2 + (10y2 + 6z) be the greatest common divisor (gcd) of two polynomials A, B ∈ [x,y, z]. Because G is not monic in the main variable x, the sparse modular ...
ISSAC
2005
Springer
14 years 5 months ago
2005
Springer
ISSAC
2005
Springer
14 years 5 months ago
2005
Springer
We present algorithms that compute the linear and quadratic factors of supersparse (lacunary) bivariate polynomials over the rational numbers in polynomial-time in the input size....
ISSAC
2005
Springer
14 years 5 months ago
2005
Springer
ISSAC
2005
Springer
14 years 5 months ago
2005
Springer
We define a class of special function inequalities that contains many classical examples, such as the Cauchy-Schwarz inequality, and introduce a proving procedure based on induct...
ISSAC
2005
Springer
14 years 5 months ago
2005
Springer
ISSAC
2005
Springer
14 years 5 months ago
2005
Springer
ISSAC
2005
Springer
14 years 5 months ago
2005
Springer
ISSAC
2005
Springer
14 years 5 months ago
2005
Springer
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...