A Modified Van der Waerden Algorithm to Decompose Algebraic Varieties and Zero-Dimensional Radical Ideals
From MaRDI portal
Publication:3598000
DOI10.1007/978-3-540-87827-8_21zbMath1166.13301OpenAlexW1492568516MaRDI QIDQ3598000
Publication date: 29 January 2009
Published in: Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87827-8_21
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalised characteristic polynomials
- Algorithm of polynomial complexity for factoring polynomials and finding the components of varieties in subexponential time
- Gröbner bases and primary decomposition of polynomial ideals
- Irreducible decomposition of algebraic varieties via characteristic sets and Gröbner bases
- An algorithm for the computation of the radical of an ideal
- A new approach to primary decomposition
This page was built for publication: A Modified Van der Waerden Algorithm to Decompose Algebraic Varieties and Zero-Dimensional Radical Ideals