Projective schemes: What is Computable in low degree?
Chardin, Marc
HAL, hal-00137102 / Harvested from HAL
Text on HAL
This article first presents two examples of algorithms that extracts information on scheme out of its defining equations. We also give a review on the notion of Castelnuovo-Mumford regularity, its main properties (in particular its relation to computational issues) and different ways that were used to estimate it.
Publié le : 2001-07-05
Classification:  [MATH.MATH-AC]Mathematics [math]/Commutative Algebra [math.AC],  [MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG] 
@article{hal-00137102,
     author = {Chardin, Marc},
     title = {Projective schemes: What is Computable in low degree?},
     journal = {HAL},
     volume = {2001},
     number = {0},
     year = {2001},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-00137102}
}

Chardin, Marc. Projective schemes: What is Computable in low degree?. HAL, Tome 2001 (2001) no. 0, . http://gdmltest.u-ga.fr/item/hal-00137102/