The computation of polynomial greatest common divisors over an algebraic number field
From MaRDI portal
Publication:582076
DOI10.1016/S0747-7171(89)80053-7zbMath0689.68042MaRDI QIDQ582076
Publication date: 1989
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68W30: Symbolic computation and algebraic computation
11R09: Polynomials (irreducibility, etc.)
Related Items
Detecting algebraic curves in bad position, \textsc{Rings}: an efficient Java/Scala library for polynomial rings, An efficient algorithm for factoring polynomials over algebraic extension field, A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics, Proper real reparametrization of rational ruled surfaces, Circuits for computing the GCD of two polynomials over an algebraic number field
Cites Work
- Approximate formulas for some functions of prime numbers
- Factoring Polynomials over Algebraic Number Fields
- Factoring Polynomials Over Algebraic Number Fields
- Cylindrical Algebraic Decomposition I: The Basic Algorithm
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- On Euclid's Algorithm and the Theory of Subresultants
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item