The complexity of computing the hilbert polynomial of smooth equidimensional complex projective varieties

Foundations of Computational Mathematics

Volumn 7, Issue 1, 2007, Pages 59-86

  Burgisser, Peter ^a   Lotz, Martin ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

COUNTING COMPLEXITY; EULER CHARACTERISTIC; HILBERT POLYNOMIAL; MULTIVARIATE POLYNOMIAL; POLYNOMIAL SPACE; POLYNOMIAL-TIME; PROJECTIVE SPACES; UPPER AND LOWER BOUNDS;

POLYNOMIAL APPROXIMATION;

TOPOLOGY;

EID: 33846897800     PISSN: 16153375     EISSN: 16153383     Source Type: Journal    
DOI: 10.1007/s10208-005-0175-0     Document Type: Article

References (55)

1. E. Bach, Sheaf cohomology is #P-hard, J. Symbolic Comput. 27(4) (1999), 429-433.
2. B. Bank, M. Giusti, J. Heintz, and G. M. Mbakop, Polar varieties and efficient real elimination, Math. Z. 238(1) (2001), 115-144.
3. B. Bank, M. Giusti, J. Heintz, and L. M. Pardo, Generalized polar varieties: Geometry and algorithms, J. Complexity 21(4) (2005), 377-412.
4. S. Basu, R. Pollack, and M.-F. Roy, Algorithms in Real Algebraic Geometry, Algorithms and Computation in Mathematics, Vol. 10, Springer-Verlag, New York, 2003.
5. D. Bayer and D. Mumford, What can be computed in algebraic geometry? in Computational Algebraic Geometry and Commutative Algebra (Cortona, 1991), SymposiaMathematica, Vol. XXXIV, pp. 1-48, Cambridge University Press, Cambridge, 1993.
6. D. Bayer and M. Stillman, Computation of Hubert functions, J. Symbolic Comput. 14 (1992), 31-50.
7. A. M. Bigatti, M. Caboara, and L. Robbiano, On the computation of Hilbert-Poincaré series, Appl. Algebra Engrg. Comm. Comput. 2(1) (1991), 21-33.
8. L. Blum, F. Cucker, M. Shub, and S. Smale, Complexity and Real Computation, Springer-Verlag, New York, 1998.
9. L. Blum, M. Shub, and S. Smale, On a theory of computation and complexity over the real numbers, Bull. Amer. Math. Soc. 21 (1989), 1-46.
10. J. P. Brasselet, From Chern classes to Milnor classes - A history of characteristic classes for singular varieties, in Singularities - Sapporo 1998, Adv. Stud. Pure Math., Vol. 29, pp. 31-52, Kinokuniya, Tokyo, 2000.
11. G. E. Bredon, Topology and Geometry, Graduate Texts in Mathematics, Vol. 139, Springer-Verlag, New York, 1993.
12. P. Bürgisser and F. Cucker, Variations by complexity theorists on three themes of Euler, Bézout, Betti, and Poincaré, in Complexity of Computations and Proofs (J. Krajicek, ed.), Quaderni di Matematica, Vol. 13, pp. 73-151, Aracne, 2004.
13. P. Bürgisser and F. Cucker, Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets, J. Complexity (2005), to appear.
14. P. Bürgisser, F. Cucker, and M. Lotz, The complexity to compute the Euler characteristic of complex varieties, C. R. Acad. Sci. Paris Sér-1339 (2004), 371-376.
15. P. Bürgisser, F. Cucker, and M. Lotz, Counting complexity classes for numeric computations III: Complex projective sets, Found. Comput. Math. 5 (2005), 351-387.
16. J. Canny, Generalized characteristic polynomials, in Symbolic and Algebraic Computation (Rome, 1988), Lecture Notes in Computer Science, Vol. 358, pp. 293-299, Springer-Verlag, Berlin, 1989.
17. S.-S. Chern, Characteristic classes of Hermitian manifolds, Ann. of Math. (2) 47 (1946), 85-121.
18. A. L. Chistov and D. Yu. Grigoriev, Complexity of quantifier elimination in the theory of algebraically closed fields, in Mathematical Foundations of Computer Science, 1984 (Prague, 1984), Lecture Notes in Computer Science, Vol. 176, pp. 17-31, Springer-Verlag, Berlin, 1984.
19. A. M. Cohen, H. Cuypers, and H. Sterk, Some Tapas of Computer Algebra, Algorithms and Computation in Mathematics, Vol. 4, Springer-Verlag, Berlin, 1999.
20. W. Decker and D. Eisenbud, Sheaf algorithms using the exterior algebra, in Computations in Algebraic Geometry with Macaulay 2, Algorithms and Comput., pp. 215-249, Springer-Verlag, Berlin, 2002.
21. A. Dickenstein, N. Fitchas, M. Giusti, and C. Sessa, The membership problem for unmixed polynomial ideals is solvable in single exponential time, Discrete Appl. Math. 33(1-3) (1991), 73-94.
22. L. Fortnow, Counting complexity, in Complexity Theory Retrospective, Vol. II, pp. 81-107, Springer-Verlag, New York, 1997.
23. W. Fulton, Young Tableaux, London Mathematical Society Student Texts, Vol. 35, Cambridge University Press, Cambridge, 1997.
24. W. Fulton. Intersection Theory, Ergebnisse der Mathematik und ihrer Grenzgebiete, Vol. 2, Springer-Verlag, Berlin, 1998.
25. W. Fulton and J. Harris, Representation Theory, Graduate Texts in Mathematics, Vol. 129, Springer-Verlag, New York, 1991.
26. W. Fulton and R. Lazarsfeld, Connectivity and its applications in algebraic geometry, in Algebraic Geometry (Chicago, IL, 1980), Lecture Notes in Mathematics, Vol. 862, pp. 26-92, Springer-Verlag, Berlin, 1981.
27. M. Giusti, Some effectivity problems in polynomial ideal theory, in EUROSAM 84 (Cambridge, 1984), Lecture Notes in Computer Science, Vol. 174, pp. 159-171, Springer-Verlag, Berlin, 1984.
28. J. Harris, Algebraic Geometry: A First Course, Graduate Texts in Mathematics, Springer-Verlag, New York, 1992.
29. R. Hartshorne, Algebraic Geometry, Graduate Texts in Mathematics, Springer-Verlag, New York, 1977.
30. F. Hirzebruch, New Topological Methods in Algebraic Geometry, Grundlehren der Mathematischen Wissenschaften, Vol. 131, Springer-Verlag, New York, 1966.
31. D. T. Huyn, A superexponential lower bound for Gröbner bases and Church-Rosser commutative Thue systems, Inform, and Control 68 (1986), 196-206.
32. S. Iitaka, Algebraic Geometry, Graduate Texts in Mathematics, Vol. 76, Springer-Verlag, New York, 1982.
33. G. Kempf and D. Laksov, The determinantal formula of Schubert calculus, Acta Math. 132 (1974), 153-162.
34. S. L. Kleiman, The transversality of a general translate, Compos. Math. 28 (1974), 287-297.
35. P. Koiran, Randomized and deterministic algorithms for the dimension of algebraic varieties, in Proc. 38th Annual IEEE Symposium on Foundations of Computer Science, pp. 36-45, 1997.
36. R-complete, J. Complexity 15(2) (1999), 227-238.
37. Y. N. Lakshman, A single exponential bound on the complexity of computing Gröbner bases of zero-dimensional ideals, in Effective Methods in Algebraic Geometry (Castiglioncello, 1990), Progress in Mathematics, Vol. 94, pp. 227-234, Birkhäuser Boston, Boston, MA, 1991.
38. Y. N. Lakshman and D. Lazard. On the complexity of zero-dimensional algebraic systems. In Effective Methods in Algebraic Geometry (Castiglioncello, 1990), Progress in Mathematics, Vol. 94, pp. 217-225, Birkhäuser Boston, Boston, MA, 1991.
39. I. G. Macdonald, Symmetric Functions and Hall Polynomials, Oxford Mathematical Monographs, Oxford University Press, New York, 1995.
40. L. Manivel. Symmetric Functions, Schubert Polynomials and Degeneracy Loci, SMF/AMS Texts and Monographs, Vol. 6, American Mathematical Society, Providence, RI, 2001.
41. E. W. Mayr, Some complexity results for polynomial ideals, J. Complexity 13 (1997), 303-325.
42. E. W. Mayr and A.R. Meyer, The complexity of the word problem for commutative semigroups and polynomial ideals, Adv. Math. 46 (1982), 305-329.
43. K. Meer, Counting problems over the reals, Theoret. Comput. Sci. 242 (2000), 41-58.
44. J. Milnor and J. D. Stasheff. Characteristic Classes. Princeton University Press, Princeton, NJ, 1974.
45. F. Mora and H. M. Möller, The computation of the Hilbert function, in EUROCAL, Lecture Notes in Computer Science, Vol. 162, pp. 157-167, Springer-Verlag, New York, 1983.
46. D. Mumford, Algebraic Geometry I: Complex Projective Varieties, Springer-Verlag, New York, 1976.
47. C. H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
48. R. Piene, Polar classes of singular varieties, Ann. Sci. École Norm. Sup. (4) 11(2) (1978), 247-276.
49. F. Severi, Sulle intersezioni delle varieta algebriche e sopra i loro caratteri e singolarita proiettive, Mem. Accad. Sci. Torino 52(2) (1902), 61-118.
50. P. Scheiblechner, Complexity of deciding connectedness of a complex algebraic variety, Manuscript, 2005.
51. I. R. Shafarevich, Basic Algebraic Geometry, Springer-Verlag, New York, 1974.
52. L. G. Valiant, The complexity of computing the permanent, Theoret. Comput. Sci. 8 (1979), 189-201.
53. L. G. Valiant, The complexity of enumeration and reliability problems, SIAM J. Comput. 8 (1979), 410-421.
54. W. V. Vasconcelos, Computational Methods in Commutative Algebra and Algebraic Geometry, Algorithms and Computation in Mathematics, Vol. 2, Springer-Verlag, Berlin, 1998.
55. E. W. Weisstein. Bernoulli number. Mathworld, Wolfram Research, Inc., http://mathworld. wolfram.com/BernoulliNumber.html.