Modular algorithms for computing minimal associated primes and radicals of polynomial ideals
From MaRDI portal
Publication:5120175
Recommendations
- Computing minimal associated primes in polynomial rings over the integers
- Prime decompositions of radicals in polynomial rings
- Computing and using minimal polynomials
- scientific article; zbMATH DE number 177873
- An algorithm for computing minimal associated primes of binomial ideals without producing redundant components
Cited in
(14)- Usage of modular techniques for efficient computation of ideal operations
- Effective algorithm for computing Noetherian operators of zero-dimensional ideals
- Algorithm for studying polynomial maps and reductions modulo prime number
- Computing and using minimal polynomials
- A symbolic algorithm for parameterizing a prime ideal
- Computation of inverses in residue class rings of parametric polynomial ideals
- Ideals modulo a prime
- Modular techniques for effective localization and double ideal quotient
- An algorithm to compute a primary decomposition of modules in polynomial rings over the integers
- Effective Algorithm for Computing Noetherian Operators of Positive Dimensional Ideals
- Merging multiple algorithms for computing comprehensive Gröbner systems using parallel processing
- Noetherian operators for local cohomology classes and holonomic d-modules associated with non-isolated hypersurface singularities
- Computing minimal associated primes in polynomial rings over the integers
- Completing parametric unimodular rows to unimodular matrices
This page was built for publication: Modular algorithms for computing minimal associated primes and radicals of polynomial ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5120175)