Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions

DOI10.1007/978-3-031-41724-5_1MaRDI QIDQ6496589

Unnamed Author, Michael B. Monagan

Publication date: 3 May 2024

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modular composition modulo triangular sets and applications
• The computation of polynomial greatest common divisors over an algebraic number field
• Fast arithmetic for triangular sets: from theory to practice
• Computing GCDs of polynomials over algebraic number fields
• On the complexity of computing with zero-dimensional triangular sets
• A fast parallel sparse polynomial GCD algorithm
• Directed evaluation
• Accelerated tower arithmetic
• P-adic reconstruction of rational numbers
• Maximal quotient rational reconstruction
• Comparing the speed of programs for sparse polynomial multiplication
• Subresultants and Reduced Polynomial Remainder Sequences
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors

This page was built for publication: Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions