The computation of polynomial greatest common divisors over an algebraic number field

DOI10.1016/S0747-7171(89)80053-7zbMATH Open0689.68042MaRDI QIDQ582076FDOQ582076

Publication date: 1989

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Recommendations

The computation of polynomial greatest common divisors over an algebraic number field
Computing GCDs of polynomials over algebraic number fields
A sparse modular GCD algorithm for polynomials over algebraic function fields
scientific article; zbMATH DE number 1263394
Algorithms for polynomial GCD computation over algebraic function fields

greatest common divisor of two polynomials

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomials (irreducibility, etc.) (11R09)

Cites Work

Approximate formulas for some functions of prime numbers
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
On Euclid's Algorithm and the Theory of Subresultants
Factoring Polynomials over Algebraic Number Fields
Cylindrical Algebraic Decomposition I: The Basic Algorithm
Title not available (Why is that?)
Title not available (Why is that?)
Factoring Polynomials Over Algebraic Number Fields
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors

Cited In (25)

In-place arithmetic for univariate polynomials over an algebraic number field
Title not available (Why is that?)
Title not available (Why is that?)
Polynomial greatest common divisor as a solution of system of linear equations
Greatest common divisors of \(u-1, v-1\) in positive characteristic and rational points on curves over finite fields
Irreducibility and greatest common divisor algorithms for sparse polynomials
Computing GCDs of polynomials over algebraic number fields
On computation of the greatest common divisor of several polynomials over a finite field.
A sparse modular GCD algorithm for polynomials over algebraic function fields
Proper real reparametrization of rational ruled surfaces
On degrees of modular common divisors and the big prime gcd algorithm
\textsc{Rings}: an efficient Java/Scala library for polynomial rings
Title not available (Why is that?)
A new method for computing polynomial greatest common divisors and polynomial remainder sequences
On the design and implementation of Brown's algorithm over the integers and number fields
A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
Circuits for computing the GCD of two polynomials over an algebraic number field
Algorithms for polynomial GCD computation over algebraic function fields
Title not available (Why is that?)
Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions
Parametric Greatest Common Divisors using Comprehensive Gröbner Systems
Detecting algebraic curves in bad position
The computation of polynomial greatest common divisors over an algebraic number field
An efficient algorithm for factoring polynomials over algebraic extension field
An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility

This page was built for publication: The computation of polynomial greatest common divisors over an algebraic number field

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582076)