The computation of polynomial greatest common divisors over an algebraic number field

Authors:
Lars Langemyr;Scott McCallum
Affiliations:
Numerical Analysis and Computing Science Royal Institute of Technology S-100 44 Stockholm, Sweden;Institut für Mathematik Johannes Kepler Universität A-4040 Linz, Austria
Venue:
Journal of Symbolic Computation
Year:
1989

Citing 6
Cited 11

Cylindrical algebraic decomposition I: the basic algorithm

SIAM Journal on Computing
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors

Journal of the ACM (JACM)
On Euclid's Algorithm and the Theory of Subresultants

Journal of the ACM (JACM)
Factoring Polynomials Over Algebraic Number Fields

ACM Transactions on Mathematical Software (TOMS)
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition

Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Factoring Polynomials over Algebraic Number Fields

SIAM Journal on Computing

On a modular algorithm for computing GCDs of polynomials over algebraic number fields

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Computing univariate GCDs over number fields

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
On the design and implementation of Brown's algorithm over the integers and number fields

ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
A modular GCD algorithm over number fields presented with multiple extensions

Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Maximal quotient rational reconstruction: an almost optimal algorithm for rational reconstruction

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Algorithms for polynomial GCD computation over algebraic function fields

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Fast rational function reconstruction

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Minimum converging precision of the QR-factorization algorithm for real polynomial GCD

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
Complete, exact and efficient implementation for computing the adjacency graph of an arrangement of quadrics

ESA'07 Proceedings of the 15th annual European conference on Algorithms
Proper real reparametrization of rational ruled surfaces

Computer Aided Geometric Design
A complete, exact and efficient implementation for computing the edge-adjacency graph of an arrangement of quadrics

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A general framework for unification in ''commutative'' theories is investigated which is based on a categorical reformulation of theory unification. We thus obtain the well-known results for abelian groups, abelian monoids and idempotent abelian monoids ...