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

DOI10.1007/978-3-031-41724-5_1MaRDI QIDQ6496589zbMATH OpenFDO

Authors Michael Monagan

Publication date 3 May 2024

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites work

• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• scientific article; zbMATH DE number 3785004 (Why is no real title available?)
• scientific article; zbMATH DE number 2151224 (Why is no real title available?)
• A fast parallel sparse polynomial GCD algorithm
• Accelerated tower arithmetic
• Comparing the speed of programs for sparse polynomial multiplication
• Computing GCDs of polynomials over algebraic number fields
• Directed evaluation
• Fast arithmetic for triangular sets: from theory to practice
• Maximal quotient rational reconstruction
• Modular composition modulo triangular sets and applications
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• On the complexity of computing with zero-dimensional triangular sets
• P-adic reconstruction of rational numbers
• Subresultants and Reduced Polynomial Remainder Sequences
• The computation of polynomial greatest common divisors over an algebraic number field

Cited in

(1)

• A modular algorithm to compute the resultant of multivariate polynomials over algebraic number fields presented with multiple extensions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6496589)