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

DOI10.1007/978-3-031-69070-9_3MaRDI QIDQ6660313

Unnamed Author, Michael B. Monagan

Publication date: 10 January 2025

zbMATH Keywords

primitive elementsalgebraic number fieldsresultantmodular algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for solving linear systems over cyclotomic fields
• Computing GCDs of polynomials over algebraic number fields
• P-adic reconstruction of rational numbers
• Maximal quotient rational reconstruction
• On Euclid's Algorithm and the Theory of Subresultants
• The Calculation of Multivariate Polynomial Resultants
• Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions

This page was built for publication: A modular algorithm to compute the resultant of multivariate polynomials over algebraic number fields presented with multiple extensions