A homotopy for solving general polynomial systems that respects m-homogenous structures
Applied Mathematics and Computation
Minimizing multi-homogeneous Bézout numbers by a local search method
Mathematics of Computation
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
What is the complexity of volume calculation?
Journal of Complexity
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Optimization and approximation problems related to polynomial system solving
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
| Hi-index | 0.00 |
Computing good estimates for the number of solutions of a polynomial system is of great importance in many areas such as computational geometry, algebraic geometry, mechanical engineering, to mention a few. One prominent and frequently used example of such a bound is the multi-homogeneous Bézout number. It provides 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ézout number. In this paper, it is proved that the problem of computing, or even estimating the optimal multi-homogeneous Bézout number is 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. As a consequence, polynomial time algorithms for estimating the minimal multi-homogeneous Bézout number up to a fixed factor cannot exist even in a randomized setting, unless BPP⊒NP.