Computing GCDs of polynomials over algebraic number fields
From MaRDI portal
Publication:1914164
DOI10.1006/jsco.1995.1052zbMath0855.68046OpenAlexW2060592224MaRDI QIDQ1914164
Publication date: 14 January 1997
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1995.1052
Symbolic computation and algebraic computation (68W30) Parallel algorithms in computer science (68W10)
Related Items
An efficient algorithm for factoring polynomials over algebraic extension field ⋮ 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 ⋮ Good reduction of Puiseux series and applications ⋮ The use of bad primes in rational reconstruction ⋮ Interval arithmetic in cylindrical algebraic decomposition
Uses Software