scientific article; zbMATH DE number 1057759

MaRDI QIDQ4352810zbMATH OpenFDO

Authors Marc Moreno Maza, Renaud Rioboo

Publication date 29 April 1999

zbMATH Keywords

algebraic numbersAXIOMD5polynomial gcdpolynomial remainder sequencespecializationsubresultantstriangular setszero dimensional systems

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Symbolic computation and algebraic computation (68W30)

Recommendations

• Computing GCDs of polynomials over algebraic number fields
• scientific article; zbMATH DE number 1303539
• The computation of polynomial greatest common divisors over an algebraic number field

Cited in

(14)

• Computing differential characteristic sets by change of ordering
• On the theories of triangular sets
• Towards faster real algebraic numbers
• Computing GCDs of polynomials over algebraic number fields
• Lexicographic Gröbner bases of bivariate polynomials modulo a univariate one
• Inversion modulo zero-dimensional regular chains
• An efficient algorithm for factoring polynomials over algebraic extension field
• Algorithms for computing triangular decomposition of polynomial systems
• The \texttt{modpn} library: bringing fast polynomial arithmetic into \texttt{Maple}
• A normal form algorithm for regular differential chains
• Decomposing polynomial sets into simple sets over finite fields: the zero-dimensional case
• A Modular Algorithm for Computing the Intersection of a One-Dimensional Quasi-Component and a Hypersurface
• When does \(\langle T \rangle\) equal \(\text{sat}(T)\)?
• A Kronecker algorithm for locally closed sets over a perfect field

Describes a project that uses

Uses Software

• AXIOM

This page was built for publication:

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