Computational aspects of the coordinate ring of an algebraic variety
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3897078 (Why is no real title available?)
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 3463767 (Why is no real title available?)
- Algorithms for the Quillen-Suslin theorem
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- Computing combinatorial decompositions of rings
- Construction of the integral closure of a finite integral domain
- Constructive normalization of an algebraic variety
- Definability and fast quantifier elimination in algebraically closed fields
- Gröbner bases and primary decomposition of polynomial ideals
- New constructive methods in classical ideal theory
- On the complexity of computing syzygies
- Serre's conjecture
- The Gröbner fan of an ideal
- The complexity of the word problems for commutative semigroups and polynomial ideals
Cited in
(6)- Computational algorithm for reduction type of CM abelian varieties
- scientific article; zbMATH DE number 1736033 (Why is no real title available?)
- An algorithm for the Quillen-Suslin theorem for monoid rings
- Algorithms for the Quillen-Suslin theorem
- Algorithmic computation of local cohomology modules and the local cohomological dimension of algebraic varieties
- Computational aspects of equivariant Hilbert series of canonical rings for algebraic curves
This page was built for publication: Computational aspects of the coordinate ring of an algebraic variety
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3203128)