J. Abbott, A. Bigatti, M. Kreuzer and L. Robbiano, Computing ideals of points, J. Symbolic Comput. 30 (2000), 341-356. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The Big Mother of All the Dualities: Möller Algorithm - Alonso, Marinari, Mora (2002) (Correct)
.... improvements and a complexity analysis, as a tool to solve the FGLM problem: here again V = P (commutative) and functionals were the coecients in a canonical form of a polynomial by a Gr obner basis; 20] presents the complete theory for P in the commutative case, eciently implemented in [1] and exploited in [9] Somehow di erent representations and algorithms are discussed in [27] and [28] based on Faug ere s methods ( 11] and in [10] all in the commutative case) M oller Algorithm has been recently generalized in the non commutative polynomial ring setting ( 29] as a tool to ....
Abbott J.; Bigatti A.; Kreuzer M.; Robbiano L. Computing Ideals of Points. J. Symb. Comp. 2000, 30, 341-356.
Computation Of Minimal Generators Of Ideals Of Fat Points - Cioffi, Orecchia (Correct)
....M oller have been generalized to the projective space P r by careful applications of the Hermite interpolation (see, for example, 12, ch. 4] for a survey about the Hermite interpolation) Hence now, if I is the ideal of n projective points, we can compute in polynomial time Gr obner bases of I [14, 1], a minimal set of homogeneous generators of I [14, 6] and, more in general, Gr obner bases of ideals of zero dimensional schemes [14, 2] In [18] a method for computing 1 2FRANCESCA CIOFFI AND FERRUCCIO ORECCHIADIP. DI MATEMATICA E APPLICAZIONI R. CACCIOPPOLI UNIV. DI NAPOLI FEDERICO II VIA ....
....is based only on linear algebra, has been described for the rst time, with a computational cost that is polynomial if the points are in generic position. So, computations on zero dimensional schemes have been already described. In particular, basing on linear functionals introduced in [14] in [1] there is an outline of a modular version of the Buchberger M oller algorithm best suited for the computation over Q and in [2] analogous results for ideals of zero dimensional schemes are obtained with a particular attention to ideals of fat points. But the implemention of this algorithm for fat ....
J. Abbott, A. Bigatti, M. Kreuzer, L. Robbiano (2000). Computing Ideals of Points. J. Symbolic Computation 30, no. 4, 351-356.
A Termination Criterion For Algorithms That Compute Algebraic.. - Cioffi (Correct)
.... TERMINATION CRITERION FOR ALGORITHMS THAT COMPUTE ALGEBRAIC CURVES VIA POINTS Francesca Cioffi The availability of polynomial algorithms for the computation of Gr obner bases ( 10] 8] [1]) and of minimal generators ( 13] 8] 5] of ideals of points encourages one in trying to obtain information about algebraic varieties of positive dimension via points. For example, given a set X of d(d 2 r) 1 distinct points of an irreducible curve C P r of degree d = deg(C) over a eld ....
J. Abbott, A. Bigatti, M. Kreuzer, L. Robbiano, Computing ideals of points, To appear on J. Symbolic Computation.
Computing Zero-Dimensional Schemes - Robbiano Self-citation (Robbiano) (Correct)
....Zero Dimensional Schemes L. Robbiano Department of Mathematics, University of Genova, Italy Abstract In my talk I will mainly speak about the motivation for computing ideals which de ne 0 dimensional schemes, and more speci cally about the content of the two papers [ABKR] and [AKR] There are several sources from which a strong demand for such a computation arises. Let me name a few. a) Algebraic Geometry. Points encode fundamental properties of algebraic varieties of which they are linear sections. This will be the main theme of the workshop. b) Numerical ....
Abbott, J., Bigatti, A.M., Kreuzer, M., Robbiano, L. (1999) Computing Ideals of Points. J. Symb. Comput., To appear.
Gröbner Bases and Generalized Padé Approximation - Farr, Gao (2004) (Correct)
No context found.
J. Abbott, A. Bigatti, M. Kreuzer and L. Robbiano, Computing ideals of points, J. Symbolic Comput. 30 (2000), 341-356.
Towards a VLSI Architecture for Interpolation-Based .. - Gross.. (2003) (Correct)
No context found.
J. Abbott, A. Bigatti, M. Kreuzer, and L. Robbiano, "Computing ideals of points," Journal of Symbolic Computation, vol. 30, no. 4, pp. 341--356, 2000.
Computing Gröbner Bases for Vanishing Ideals of Finite Sets of.. - Farr, Gao (2004) (Correct)
No context found.
J. Abbott, A. Bigatti, M. Kreuzer and L. Robbiano, Computing ideals of points, J. Symbolic Comput. 30 (2000), 341-356.
Computer Algebra for Fingerprint Matching - Bistarelli, Bo, Rossi (Correct)
No context found.
Abbott, J., Bigatti, A., Kreuzer, M., Robbiano, L.: Computing ideals of points. J. Symbolic Comput. 30 (2000) 341--356
Gröbner Basis Structure of Finite Sets of Points - Gao, Rodrigues, Stroomer (2003) (Correct)
No context found.
J. Abbott, A. Bigatti, M. Kreuzer and L. Robbiano, Computing ideals of points, J. Symbolic Comput. 30 (2000), 341-356.
Towards a VLSI Architecture for Interpolation-Based .. - Gross.. (2003) (Correct)
No context found.
J. Abbott, A. Bigatti, M. Kreuzer, and L. Robbiano, "Computing ideals of points," "Journal of Symbolic Computation", vol. 30, no. 4, pp. 341--356, 2000. 19
Simulation Results for Algebraic Soft-Decision.. - Gross.. (Correct)
No context found.
J. Abbott, A. Bigatti, M. Kreuzer, and L. Robbiano, "Computing ideals of points," "J. Symbolic Computation", vol. 30, no. 4, pp. 341--356, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC