The Complexity of the Annihilating Polynomial

Let F be a field and f₁,..., f_k in F[x₁, ..., x_n] be a set of k polynomials of degree d in n variables over the field F. These polynomials are said to be algebraically dependent if there exists a nonzero k-variate polynomial A(t₁, ..., t_k) in F[t₁, ..., t_k] such that A(f₁, ..., f_k) = 0. A is then called an (f₁, ..., f_k)-annihilating polynomial. Within computer science, the notion of algebraic dependence was used in Dvir, Gabizon and Wigderson to construct explicit deterministic extractors from low-degree polynomial sources. They also observed that given (f₁, ..., f_k) as arithmetic circuits, there exists an efficient randomized algorithm for testing their algebraic independence. The problems of determining good bounds on the degree of the annihilating polynomial and of computing it explicitly were posed as open questions. We solve the two posed problems in the following way: 1) We give closely matching upper and lower bounds for the degree of the annihilating polynomial. 2) We show that it is NP-hard to decide if A(0, .. ,0) equals zero and #P-hard to evaluate A(0,...,0)(mod p) for a given prime p. Indeed the annihilating polynomial A(t₁, .., t_k)$ does not even admit a small circuit representation unless the polynomial hierarchy collapses. This then, to the best of our knowledge, is the only natural computational problem where determining the existence of an object (the annihilating polynomial in our case) can be done efficiently but the actual computation of the object is provably hard.