Abstract
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 ⫆ NP.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Malajovich, G., Meer, K. Computing Minimal Multi-Homogeneous Bezout Numbers Is Hard. Theory Comput Syst 40, 553–570 (2007). https://doi.org/10.1007/s00224-006-1322-y
Issue Date:
DOI: https://doi.org/10.1007/s00224-006-1322-y