Computing GCDs of polynomials over algebraic number fields
From MaRDI portal
Publication:1914164
DOI10.1006/jsco.1995.1052zbMath0855.68046MaRDI 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
68W30: Symbolic computation and algebraic computation
68W10: Parallel algorithms in computer science
Related Items
A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics, Interval arithmetic in cylindrical algebraic decomposition
Uses Software