Algorithmic local monomialization of a binomial: A comparison of different approaches
From MaRDI portal
Publication:5877368
Recommendations
- Algorithms for testing monomials in multivariate polynomials
- Complexity of Comparing Monomials and Two Improvements of the Buchberger-Möller Algorithm
- Algorithms in local algebra
- The monomial method: Extensions, variations, and performance issues
- scientific article; zbMATH DE number 1929302
- COMPLEXITY OF VILLAMAYOR'S ALGORITHM IN THE NON-EXCEPTIONAL MONOMIAL CASE
- Algorithm of polynomial complexity for factoring polynomials over local fields
- Decomposition of monomial algebras: applications and algorithms
Cites work
- A compactification of open varieties
- A strictly decreasing invariant for resolution of singularities in dimension two
- Embedded desingularization for arithmetic surfaces -- toward a parallel implementation
- Invariance of Hironaka's characteristic polyhedron
- Resolution of singularities of an algebraic variety over a field of characteristic zero. II
- Wonderful compactification of an arrangement of subvarieties
Cited in
(2)
This page was built for publication: Algorithmic local monomialization of a binomial: A comparison of different approaches
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5877368)