On the complexity of diophantine geometry in low dimensions

We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, we show that the following two problems can be solved within PSPACE: I. Given polynomials f₁,…,f_m∈Z[x₁ ,…,x_n] defining a variety of dimension ⩽0 in Cⁿ, find all solutions in Zⁿ of f₁=···=f_m=0. II. For a given polynomial f∈Z[v,x,y] defining an irreducible nonsingular non-ruled surface in C³, decide the sentence ∃v ∀x ∃y f(v, z, y)=^?0, quantified over N. Better still, we show that the truth of the Generalized Riemann Hypothesis (GRH) implies that detecting roots in Qⁿ for the polynomial systems in problem (I) can be done via a two-round Arthur-Merlin protocol, i.e., well within the second level of the polynomial hierarchy. (Problem (I) is, of course, undecidable without the dimension assumption.) The decidability of problem (II) was previously unknown. Along the way, we also prove new complexity and size bounds for solving polynomial systems over C and Z/pZ. A practical point of interest is that the aforementioned Diophantine problems should perhaps be avoided in the construction of cryptosystems