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

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

Authors: Michael Monagan 

Publication date: 3 May 2024

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• Title not available (Why is that?)
• On the complexity of computing with zero-dimensional triangular sets
• Modular composition modulo triangular sets and applications
• P-adic reconstruction of rational numbers
• Subresultants and Reduced Polynomial Remainder Sequences
• 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
• Title not available (Why is that?)
• Comparing the speed of programs for sparse polynomial multiplication
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• Maximal quotient rational reconstruction
• Title not available (Why is that?)
• Accelerated tower arithmetic
• A fast parallel sparse polynomial GCD algorithm
• Directed evaluation

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)