A failure probability analysis of a modular algorithm to compute the monic GCD of multivariate polynomials over algebraic number fields Q(_1,,_n)

DOI10.1007/978-3-032-09645-6_1MaRDI QIDQ6851550zbMATH OpenFDO

Authors Michael Monagan

Publication date 27 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-09645-6_1

zbMATH Keywords

algebraic number fieldsfailure probabilitymodular algorithms

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites work

• A modular algorithm to compute the resultant of multivariate polynomials over algebraic number fields presented with multiple extensions
• Computing GCDs of polynomials over algebraic number fields
• Computing GCDs of Multivariate Polynomials over Algebraic Number Fields Presented with Multiple Extensions
• scientific article; zbMATH DE number 108109 (Why is no real title available?)
• scientific article; zbMATH DE number 2151224 (Why is no real title available?)
• Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
• Maximal quotient rational reconstruction
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• The Calculation of Multivariate Polynomial Resultants
• The computation of polynomial greatest common divisors over an algebraic number field

This page was built for publication: A failure probability analysis of a modular algorithm to compute the monic GCD of multivariate polynomials over algebraic number fields \({\mathbb{Q}(\alpha_1,\ldots,\alpha_n)} \)

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