Computing GCDs of polynomials over algebraic number fields
From MaRDI portal
Recommendations
- The computation of polynomial greatest common divisors over an algebraic number field
- The computation of polynomial greatest common divisors over an algebraic number field
- Algorithms for polynomial GCD computation over algebraic function fields
- scientific article; zbMATH DE number 1263394
- scientific article; zbMATH DE number 1057759
- scientific article; zbMATH DE number 1303539
- Circuits for computing the GCD of two polynomials over an algebraic number field
- On computing polynomial GCDs in alternate bases
- Computation of approximate polynomial GCDs and an extension
- On computation of the greatest common divisor of several polynomials over a finite field.
Cited in
(30)- Circuits for computing the GCD of two polynomials over an algebraic number field
- A subspace method for the computation of the GCD of polynomials
- On computation of the greatest common divisor of several polynomials over a finite field.
- On degrees of modular common divisors and the big prime gcd algorithm
- Interval arithmetic in cylindrical algebraic decomposition
- On computing polynomial GCDs in alternate bases
- On the design and implementation of Brown's algorithm over the integers and number fields
- An efficient algorithm for factoring polynomials over algebraic extension field
- scientific article; zbMATH DE number 4110094 (Why is no real title available?)
- scientific article; zbMATH DE number 17841 (Why is no real title available?)
- Polynomial GCD derived through monic polynomial subtractions
- scientific article; zbMATH DE number 1263394 (Why is no real title available?)
- scientific article; zbMATH DE number 1303539 (Why is no real title available?)
- scientific article; zbMATH DE number 1057759 (Why is no real title available?)
- Algorithms for polynomial GCD computation over algebraic function fields
- scientific article; zbMATH DE number 2151224 (Why is no real title available?)
- In-place arithmetic for univariate polynomials over an algebraic number field
- Computation of the GCD of polynomials using gaussian transformations and shifting
- A sparse modular GCD algorithm for polynomials over algebraic function fields
- The computation of polynomial greatest common divisors over an algebraic number field
- The use of bad primes in rational reconstruction
- The computation of polynomial greatest common divisors over an algebraic number field
- Fundamentals of Computation Theory
- Computing Logarithmic Parts by Evaluation Homomorphisms✱
- \textsc{Rings}: an efficient Java/Scala library for polynomial rings
- A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics
- Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions
- Good reduction of Puiseux series and applications
- A modular algorithm to compute the resultant of multivariate polynomials over algebraic number fields presented with multiple extensions
- A failure probability analysis of a modular algorithm to compute the monic GCD of multivariate polynomials over algebraic number fields \({\mathbb{Q}(\alpha_1,\ldots,\alpha_n)} \)
This page was built for publication: Computing GCDs of polynomials over algebraic number fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1914164)
