Computing irredundant irreducible decompositions of large scale monomial ideals
From MaRDI portal
Publication:4657331
DOI10.1145/1005285.1005320zbMath1134.13306OpenAlexW2103817842MaRDI QIDQ4657331
Publication date: 14 March 2005
Published in: Proceedings of the 2004 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1005285.1005320
Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05)
Related Items (4)
Reverse search for monomial ideals ⋮ Reverse-engineering of polynomial dynamical systems ⋮ Tropical convexity via cellular resolutions ⋮ The slice algorithm for irreducible decomposition of monomial ideals
Uses Software
This page was built for publication: Computing irredundant irreducible decompositions of large scale monomial ideals
