scientific article; zbMATH DE number 4132307

MaRDI QIDQ3033871zbMATH OpenFDO

Authors M. E. Alonso, Ignacio Luengo, Mario Raimondo

Publication date 1989

zbMATH Keywords

algorithmmultivariate polynomialscomputable fieldquasi-ordinary polynomials

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Formal power series rings (13F25) Software, source code, etc. for problems pertaining to commutative algebra (13-04)

Recommendations

• Approximate roots of quasi-ordinary polynomials
• Higher order polars of quasi-ordinary singularities
• Quasi-Ordinary Singularities: Tree Model, Discriminant, and Irreducibility
• A polyhedral characterization of quasi-ordinary singularities
• Polar quotients of a plane curve and the Newton algorithm

Cited in

(13)

• A Fast Schur–Euclid-Type Algorithm for Quasiseparable Polynomials
• Quadratic-Time Algorithms for Normal Elements
• Polar quotients of a plane curve and the Newton algorithm
• QD-algorithms and recurrence relations for biorthogonal polynomials
• scientific article; zbMATH DE number 4101330 (Why is no real title available?)
• A new algorithm for the Quillen-Suslin theorem
• First-hit analysis of algorithms for computing quadratic irregularity
• Polynomial-time algorithms for quadratic isomorphism of polynomials: the regular case
• La queste del Saint \(\text{Gr}_ a(\text{AL})\): A computational approach to local algebra
• A computational model for algebraic power series
• A polyhedral characterization of quasi-ordinary singularities
• An Egyptian algorithm for polynomials
• The general quasi-order algorithm in number theory

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 Q3033871)