Computing Multi-Homogeneous Bezout Numbers is Hard

Details Computing Multi-Homogeneous Bezout Numbers is Hard Computing Multi-Homogeneous Bezout Numbers is Hard

2004-05-05

arxiv.org/abs/cs/0405021v1

Theory of Computing Systems, Volume 40, Number 4 / June, 2007

Computer Science

Computational Complexity

Scientific paper

10.1007/s00224-006-1322-y

The multi-homogeneous Bezout number is a bound for the number of solutions of a system of multi-homogeneous polynomial equations, in a suitable product of projective spaces. Given an arbitrary, not necessarily multi-homogeneous system, one can ask for the optimal multi-homogenization that would minimize the Bezout number. In this paper, it is proved that the problem of computing, or even estimating the optimal multi-homogeneous Bezout number is actually NP-hard. In terms of approximation theory for combinatorial optimization, the problem of computing the best multi-homogeneous structure does not belong to APX, unless P = NP. Moreover, polynomial time algorithms for estimating the minimal multi-homogeneous Bezout number up to a fixed factor cannot exist even in a randomized setting, unless BPP contains NP.

Affiliated with

Also associated with

No associations

Rating

Computing Multi-Homogeneous Bezout Numbers is Hard 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 Computing Multi-Homogeneous Bezout Numbers is Hard, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing Multi-Homogeneous Bezout Numbers is Hard will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-467125