The computation of polynomial greatest common divisors over an algebraic number field
From MaRDI portal
(Redirected from Publication:582076)
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
Cites work
- scientific article; zbMATH DE number 3858405 (Why is no real title available?)
- scientific article; zbMATH DE number 3920595 (Why is no real title available?)
- scientific article; zbMATH DE number 3922806 (Why is no real title available?)
- scientific article; zbMATH DE number 3785018 (Why is no real title available?)
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 1157658 (Why is no real title available?)
- Approximate formulas for some functions of prime numbers
- Cylindrical Algebraic Decomposition I: The Basic Algorithm
- Factoring Polynomials Over Algebraic Number Fields
- Factoring Polynomials over Algebraic Number Fields
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- On Euclid's Algorithm and the Theory of Subresultants
Cited in
(25)- scientific article; zbMATH DE number 17841 (Why is no real title available?)
- In-place arithmetic for univariate polynomials over an algebraic number field
- Greatest common divisors of u-1, v-1 in positive characteristic and rational points on curves over finite fields
- Polynomial greatest common divisor as a solution of system of linear equations
- scientific article; zbMATH DE number 1303539 (Why is no real title available?)
- 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
- A new method for computing polynomial greatest common divisors and polynomial remainder sequences
- \textsc{Rings}: an efficient Java/Scala library for polynomial rings
- scientific article; zbMATH DE number 1253996 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 2151224 (Why is no real title available?)
- 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
- An efficient algorithm for factoring polynomials over algebraic extension field
- The computation of polynomial greatest common divisors over an algebraic number 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)
