A modular GCD algorithm over number fields presented with multiple extensions

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2002, Pages 109-116

  Van Hoeij, Mark ^a   Monagan, Michael ^a  

^a FLORIDA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; NUMBER THEORY; POLES AND ZEROS; POLYNOMIALS; PROBLEM SOLVING; VECTORS;

ENCARNACION MODULAR GCD ALGORITHMS; EUCLIDEAN ALGORITHMS; MULTIVARIATE POLYNOMIALS; PRIMES;

ALGORITHMS;

EID: 0036046285     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780506.780520     Document Type: Conference Paper

References (11)

1. The bath algebraic number package
2. Some results on the defect
3. On Euclid's algorithm and the computation of polynomial greatest common divisors
4. Computing GCDs of polynomials over algebraic number fields
5. Lectures on the theory of algebraic numbers
6. A modular GCD algorithm over number fields presented with multiple extensions
7. The computation of polynomial GCD's over an algebraic number field
8. On the design and implementation of Brown's algorithm over the integers and number fields
9. Which polynomial representation is best?
10. p-adic reconstruction of rational numbers
11. Probabilistic algorithms for sparse polynomials