The Multivariate Resultant is NP-hard in any Characteristic

Details The Multivariate Resultant is NP-hard in any Characteristic The Multivariate Resultant is NP-hard in any Characteristic

2009-12-14

arxiv.org/abs/0912.2607v2

Dans Mathematical Foundations of Computer Science 2010 - Mathematical Foundations of Computer Science 2010, Brno : Czech Repub

Computer Science

Computational Complexity

13 pages

Scientific paper

The multivariate resultant is a fundamental tool of computational algebraic geometry. It can in particular be used to decide whether a system of n homogeneous equations in n variables is satisfiable (the resultant is a polynomial in the system's coefficients which vanishes if and only if the system is satisfiable). In this paper we present several NP-hardness results for testing whether a multivariate resultant vanishes, or equivalently for deciding whether a square system of homogeneous equations is satisfiable. Our main result is that testing the resultant for zero is NP-hard under deterministic reductions in any characteristic, for systems of low-degree polynomials with coefficients in the ground field (rather than in an extension). We also observe that in characteristic zero, this problem is in the Arthur-Merlin class AM if the generalized Riemann hypothesis holds true. In positive characteristic, the best upper bound remains PSPACE.

Affiliated with

Also associated with

No associations

Rating

The Multivariate Resultant is NP-hard in any Characteristic 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 Multivariate Resultant is NP-hard in any Characteristic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Multivariate Resultant is NP-hard in any Characteristic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-624291