Next: Geometry
Up: Commutative Algebra
Previous: Polynomial Rings
Ideal Theory and Gröbner Bases
New Features:
- The algorithm for computing a Gröbner basis over a euclidean
ring has been greatly sped up (by more intelligent pair selection).
- The algorithm for computing a Gröbner basis over
Z
has
been greatly sped up by using modular techniques where possible.
- The algorithm for computing the primary decomposition of a zero-dimensional
ideal over
Q
been greatly sped up for several classes of inputs.
Next: Geometry
Up: Commutative Algebra
Previous: Polynomial Rings