The Computational Complexity of the Chow Form

Foundations of Computational Mathematics

Volumn 4, Issue 1, 2004, Pages 41-117

  Jeronimo, Gabriela ^a   Krick, Teresa ^a   Sabia, Juan ^a   Sombra, Martín ^b,c  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

^b UNIVERSITÉ PARIS DESCARTES   (France)

^c UNIVERSIDAD NACIONAL DE LA PLATA   (Argentina)

Author keywords

Chow form; Equidimensional decomposition of algebraic varieties; Overdetermined polynomial equation system; Sparse resultant; Symbolic Newton algorithm

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; PARTIAL DIFFERENTIAL EQUATIONS; POLYNOMIALS; PROBABILITY; SET THEORY;

BOUNDED PROBABILITY ALGORITHM; CHOW FORM;

COMPUTATIONAL COMPLEXITY;

EID: 1642632892     PISSN: 16153375     EISSN: 16153383     Source Type: Journal    
DOI: 10.1007/s10208-002-0078-2     Document Type: Article

References (62)

1. J. Abdeljaoued, Algorithmes rapides pour le calcul du polynôme caractéristique, Ph.D. dissertation, Univ. Franche-Comté, Besancon, France, 1997.
2. S. J. Berkowitz, On computing the determinant in small parallel time using a small number of processors, Inform. Process. Lett. 18 (1984), 147-150.
3. W. Baur and W. Strassen, The complexity of partial derivatives, Theoret. Comput. Sci. 22 (1983), 317-330.
4. C. Blanco, G. Jeronimo, and P. Solernó, Computing generators of the ideal of a smooth affine algebraic variety, Preprint Univ. Buenos Aires, 2003.
5. L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and Real Computation, Springer-Verlag, New York, 1998.
6. N. Bourbaki, Éléments de Mathématique. Algèbre Commutative, Hermann, Paris, 1961.
7. W. S. Brown and J. F. Traub, On Euclid's algorithm and the theory of subresultants, J. Assoc. Comput. Mach. 18 (1971), 505-514.
8. P. Bürgisser, M. Clausen, and M. A. Shokrollahi, Algebraic Complexity Theory, Springer-Verlag, New York, 1997.
9. L. Caniglia, How to compute the Chow form of an unmixed ideal in single exponential time, Appl. Algebra Engrg. Comm. Comput. 1 (1990), 25-41.
10. J. F. Canny and I. Z. Emiris, An Efficient Algorithm for the Sparse Mixed Resultant, Proceedings of the Tenth International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, San Juan, Puerto Rico, 1993 (AAECC-10) (G. Cohen, et al., eds.), Lecture Notes in Comput. Sci., Vol. 263, 1993, 89-104.
11. J. F. Canny and I. Z. Emiris, A subdivision-based algorithm for the sparse resultant, J. Assoc. Comput. Mach. 47 (2000), 417-451.
12. D. Castro, M. Giusti, J. Heintz, G. Matera, and L. M. Pardo, The hardness of polynomial equation solving, Found. Comput. Math. 3 (2003), 347-420.
13. A. L. Chistov and D. Y. Grigoriev, Subexponential time solving systems of algebraic equations, LOMI preprint E-9-83, E-10-83, Steklov Institute, Leningrad, 1983.
14. G. E. Collins, Subresultants and reduced polynomial remainder sequences, J. Assoc. Comput. Mach. 14 (1967), 128-142.
15. D. Cox, J. Little, and D. O'Shea, Using Algebraic Geometry, Graduate Texts in Mathematics, Vol. 185, Springer-Verlag, New York, 1998.
16. J. Dalbec and B. Sturmfels, Introduction to Chow forms, Invariant Methods in Discrete and Computational Geometry (Curaçao, 1994), Kluwer, Amsterdam, 1995, pp. 37-58.
17. C. D'Andrea, Macaulay's style formulas for sparse resultants, Trans. Amer. Math. Soc. 354, (2002), 2595-2629.
18. C. D'Andrea and A. Dickenstein, Explicit formulas for the multivariate resultant, J. Pure Appl. Algebra 164 (2001), 59-86.
19. D. Eisenbud, Commutative Algebra with a View Toward Algebraic Geometry, Graduate Texts in Mathematics, Vol. 150, Springer-Verlag, New York, 1995.
20. M. Elkadi and B. Mourrain, A new algorithm for the geometric decomposition of a variety, Proc. ISSAC'1999 ACM (1999), 9-16.
21. I. Emiris and B. Mourrain, Matrices in elimination theory, J. Symbolic Comput. 28 (1999), 3-44.
22. I. M. Gelfand, M. M. Kapranov, and A. V. Zelevinsky, Discriminants, Resultants, and Multidimensional Determinants, Birkhäuser, Boston, 1994.
23. M. Giusti, K. Hägele, J. Heintz, J. L. Montana, L. M. Pardo, and J. E. Morais, Lower bounds for Diophantine approximation, J. Pure Appl. Algebra 117 & 118 (1997), 277-317.
24. M. Giusti and J. Heintz, La détermination des points isolés et de la dimension d'une variété algébrique peut se faire en temps polynomial, Computational Algebraic Geometry and Commutative Algebra (D. Eisenbud and L. Robbiano, eds.), Sympos. Math., Vol. XXXIV (1993), 216-256.
25. M. Giusti and J. Heintz, Algorithmes - Disons Rapides - pour la Décomposition d'une Varieté Algébrique en Composantes Irréductibles et Équidimensionelles, Proceedings of the International Conference on Effective Methods in Algebraic Geometry, Castiglioncello, Spain, 1990 (MEGA '90) (T. Mora and C. Traverse, eds.), Progress in Mathematics, Vol. 94, Birkhäuser, Boston, 1991, pp. 164-194.
26. M. Giusti and J. Heintz, Kronecker's smart, little black-boxes, Proceedings of Foundations of Computational Mathematics, Vol. 284, Oxford 1999 (FoCM'99) (A. Iserles and R. DeVore, eds.), Cambridge University Press, Cambridge, 2001, pp. 69-104.
27. M. Giusti, J. Heintz, J. E. Morais, J. Morgenstern, and L. M. Pardo, Straight-line programs in geometric elimination theory, J. Pure Appl. Algebra 124 (1998), 101-146.
28. M. Giusti, J. Heintz, J. E. Morais, and L. M. Pardo, When polynomial equation systems can be "solved" fast?, Proc. 11th International Symposium Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC-11, Paris 1995 (G. Cohen, M. Giusti and T. Mora, eds.), Lecture Notes in Comput. Sci., Vol. 948, Springer-Verlag, Berlin, 1995, pp. 205-231.
29. M. Giusti, J. Heintz and J. Sabia, On the efficiency of effective Nullstellensätze, Comput. Complexity 3 (1993), 56-95.
30. M. Giusti, G. Lecerf, and B. Salvy, A Gröbner free alternative for polynomial system solving, J. Complexity 17 (2001), 154-211.
31. J. Harris, Algebraic Geometry, Graduate Texts in Mathematics, Vol. 133, Springer-Verlag, New York, 1992.
32. J. Heintz, Definability and fast quantifier elimination in algebraically closed fields, Theoret. Comput. Sci. 24 (1983), 239-277.
33. J. Heintz, On the computational complexity of polynomials and bilinear maps. A survey, Lecture Notes in Comput. Sci., Vol. 356, Springer-Verlag, Berlin, 1989, pp. 269-300.
34. J. Heintz, T. Krick, S. Puddu, J. Sabia, and A. Waissbein, Deformation techniques for efficient polynomial equation solving, J. Complexity 16 (2000), 70-109.
35. J. Heintz, G. Matera, L. M. Pardo, and R. Wachenchauzer, The intrinsic complexity of parametric elimination methods, Electronic J. SADIO 1 (1998), 37-51.
36. J. Heintz, G. Matera, and A. Waissbein, On the time-space complexity of geometric elimination procedures, Appl. Algebra Engrg. Comm. Comput. 11 (2001), 239-296.
37. G. Jeronimo, S. Puddu, and J. Sabia, Computing Chow forms and some applications, J. Algorithms 41 (2001), 52-68.
38. G. Jeronimo and J. Sabia, Effective equidimensional decomposition of affine varieties, J. Pure Appl. Algebra 169 (2002), 229-248.
39. J. P. Jouanolou, Formes d'inertie et résultant: un formulaire, Adv. in Math. 126 (1997), 119-250.
40. E. Kaltofen, Greatest common divisors of polynomials given by straight-line programs, J. Assoc. Comput. Mach. 35 (1988), 234-264.
41. T. Krick, Complejidad para problemas de geometría elemental, Ph.D. dissertation, Univ. Buenos Aires, Buenos Aires, Argentina, 1990.
42. T. Krick and L. M. Pardo, A Computational Method for Diophantine Approximation, Proceedings of the International Conference on Effective Methods in Algebraic Geometry, Santander, Spain, (MEGA '94) (G.-V. Laureano et al., eds.), Progress in Mathematics, Vol. 143, Birkhäuser, Boston, 1996, pp. 193-253.
43. T. Krick, L. M. Pardo, and M. Sombra, Sharp estimates for the arithmetic Nullstellensatz, Duke Math. J. 109, (2001), 521-598.
44. T. Krick, J. Sabia, and P. Solernó, On intrinsic bounds in the Nullstellensatz, Appl. Algebra Engrg. Comm. Comput. 8 (1997), 125-134.
45. G. Lecerf, Kronecker, a Magma package for polynomial system solving, available at http://kronecker.medicis.polytechnique.fr/.
46. G. Lecerf, Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions, Proc. ISSAC'2000, ACM (2000), 209-216.
47. G. Lecerf, Quadratic Newton iteration for systems with multiplicity, Found. Comput. Math. 2 (2002), 247-293.
48. G. Lecerf, Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers, J. Complexity 19 (2003), 564-596.
49. F. Macaulay, Some formulae in elimination, Proc. London Math. Soc. Ser. 1, 33 (1902), 3-27.
50. P. Philippen, Critères pour l'indépendance algébrique, Inst. Hautes Études Sci. Publ. Math. 64 (1986), 5-52.
51. S. Puddu and J. Sabia, An effective algorithm for quantifier elimination over algebraically closed fields using straight line programs, J. Pure Appl. Algebra 129 (1998), 173-200.
52. J. M. Rojas, Toric laminations, sparse generalized characteristic polynomials, and a refinement of Hilbert's tenth problem, Proceedings of Foundations of Computational Mathematics, Rio de Janeiro, 1997 (Proc. FoCM'97), Springer-Verlag, New York, 1997, pp. 369-381.
53. J. T. Schwartz, Fast probabilistic algorithms for verification of polynomial identities, J. Assoc. Comput. Mach. 27 (1980), 701-717.
54. I. Shafarevich, Basic Algebraic Geometry, Springer-Verlag, New York, 1972.
55. V. Strassen, Berechnung und Programm I, II, Acta Inform. 1 (1972), 320-355; ibid. 2 (1973), 64-79.
56. V. Strassen, Berechnung und Programm I, II, Acta Inform. 1 (1972), 320-355; ibid. 2 (1973), 64-79.
57. V. Strassen, Vermeidung von Divisionen, J. Reine Angew. Math. 264 (1973), 182-202.
58. B. Sturmfels, Sparse elimination theory, Computational Algebraic Geometry and Commutative Algebra (D. Eisenbud and L. Robbiano, eds.), Cambridge University Press, Cambridge, 1993, pp. 377-396.
59. B. Sturmfels, On the Newton polytope of the resultant, J. Algebraic Combinatorics 3 (1994), 207-236.
60. A. Szántó, Solving over-determined systems by subresultant method, Preprint (2001).
61. W. Vogel, Lectures on Results on Bezout's Theorem, Tata Institute of Fundamental Research, Lectures on Mathematics and Physics, Vol. 74, Springer-Verlag, Berlin, 1984.
62. R. Zippel, Probabilistic algorithms for sparse polynomials, Proceedings EUROSAM'79, Lecture Notes in Comput. Sci., Vol. 72, Springer-Verlag, Berlin, 1979, pp. 216-226.