Authors: Thinh Nguyen
The multi-homogeneous B´ezout 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 B´ezout number. In this paper, it is proved that the problem of computing, or even estimating the optimal multi-homogeneous B´ezout 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 multihomogeneous B´ezout number up to a fixed factor cannot exist even in a randomized setting, unless BPP⊇NP.
Comments: 17 Pages.
[v1] 2018-06-24 12:50:58
Unique-IP document downloads: 24 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.