Ideals of points in generic position: A polynomial algorithm for computing a minimal set of generators

zbMath0918.68056MaRDI QIDQ1277608

Isabella Ramella

Publication date: 1 March 1999

Published in: Ricerche di Matematica (Search for Journal in Brave)

zbMATH Keywords

complexitypoints in generic position of the projective space

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Varieties defined by ring conditions (factorial, Cohen-Macaulay, seminormal) (14M05) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (2)

Maximal rank and minimal generation of some parametric varieties. ⋮ Implicitization of a general union of parametric varieties

This page was built for publication: Ideals of points in generic position: A polynomial algorithm for computing a minimal set of generators