Name
Abstract | ||
|---|---|---|
Let k be a field and V be an algebraic subset of the affine space A ( k n ) given by a family of polynomials with degrees bounded. The projective closure pcl( V ) of V in P n is the smallest closed projective subset of P n containing V . We describe an efficiently parallelisable subexponential time algorithm to compute equations for pcl( V ). We also show how equations for pcl( V ) can be obtained by suitably truncated Groebner basis algorithms. The proof of the two algorithms are based on an effective Nullstellensatz. |
Year | DOI | Venue |
|---|---|---|
1991 | 10.1016/0166-218X(91)90105-6 | Discrete Applied Mathematics |
Keywords | Field | DocType |
projective closure,effective nullstellensatz | Discrete mathematics,Combinatorics,Affine space,Algebraic number,Polynomial,Gröbner basis,Mathematics,Projective test,Bounded function,Projective space | Journal |
Volume | Issue | ISSN |
33 | 1-3 | Discrete Applied Mathematics |
Citations | PageRank | References |
12 | 0.77 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Leandro Caniglia | 1 | 49 | 6.03 |
| A. Galligo | 2 | 76 | 11.72 |
| J. Heintz | 3 | 162 | 19.20 |