Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Highly Cited

2006

Highly Cited

2006

We consider the problem of computing minimal real or complex deformations to the coefficients in a list of relatively prime real… Expand

Is this relevant?

2004

2004

The main purpose of this article is to present algorithms to parameterize the degree of the greatest common divisor of two… Expand

Is this relevant?

2000

2000

This paper presents a novel means of computing the greatest common divisor (GCD) of two polynomials with real-valued coefficients… Expand

Is this relevant?

Highly Cited

1996

Highly Cited

1996

The problem of computing the greatest common divisor (gcd) of two polynomials ~, g ~ A[z], A being a unique factorization domain… Expand

Is this relevant?

Highly Cited

1990

Highly Cited

1990

A fundamental technique used by many algorithms in computer algebrais interpolating polynomials from their values. This paper… Expand

Is this relevant?

1990

1990

Algorithms are developed that adopt a novel implicit representation for multivariate polynomials and rational functions with… Expand

Is this relevant?

Highly Cited

1988

Highly Cited

1988

Algorithms are developed that adopt a novel implicit representation for multivariate polynomials and rational functions with… Expand

Is this relevant?

1987

1987

We present an algorithm for computing the greatest common divisor of two polynomials over an algebraic number field. We obtain a… Expand

Is this relevant?

1974

1974

Two Hensel-type univariate polynomial Greatest Common Divisor (GCD) algorithms are presented and compared. The regular linear… Expand

Is this relevant?

1971

1971

This paper examines the computation of polynomial greatest common divisors by various generalizations of Euclid's algorithm. The… Expand

Is this relevant?