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

Details The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties

2005-02-08

arxiv.org/abs/cs/0502044v1

Computer Science

Symbolic Computation

Scientific paper

We continue the study of counting complexity begun in [Buergisser, Cucker 04] and [Buergisser, Cucker, Lotz 05] by proving upper and lower bounds on the complexity of computing the Hilbert polynomial of a homogeneous ideal. We show that the problem of computing the Hilbert polynomial of a smooth equidimensional complex projective variety can be reduced in polynomial time to the problem of counting the number of complex common zeros of a finite set of multivariate polynomials. Moreover, we prove that the more general problem of computing the Hilbert polynomial of a homogeneous ideal is polynomial space hard. This implies polynomial space lower bounds for both the problems of computing the rank and the Euler characteristic of cohomology groups of coherent sheaves on projective space, improving the #P-lower bound of Bach (JSC 1999).

Affiliated with

Also associated with

No associations

Rating

The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The complexity of computing the Hilbert polynomial of smooth equidimensional complex projective varieties will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-28077