Computational Arithmetic Geometry I: Sentences Nearly in the Polynomial Hierarchy

Details Computational Arithmetic Geometry I: Sentences Nearly in the Polynomial Hierarchy Computational Arithmetic Geometry I: Sentences Nearly in the Polynomial Hierarchy

2000-05-03

arxiv.org/abs/math/0005029v2

Mathematics

Number Theory

Slight revision of final journal version of an extended abstract which appeared in STOC 1999. This version includes significan

Scientific paper

We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, consider the following: (I) Given a polynomial f in Z[v,x,y], decide the sentence \exists v \forall x \exists y f(v,x,y)=0, with all three quantifiers ranging over N (or Z). (II) Given polynomials f_1,...,f_m in Z[x_1,...,x_n] with m>=n, decide if there is a rational solution to f_1=...=f_m=0. We show that, for almost all inputs, problem (I) can be done within coNP. The decidability of problem (I), over N and Z, was previously unknown. We also show that the Generalized Riemann Hypothesis (GRH) implies that, for almost all inputs, problem (II) can be done via within the complexity class PP^{NP^NP}, i.e., within the third level of the polynomial hierarchy. The decidability of problem (II), even in the case m=n=2, remains open in general. Along the way, we prove results relating polynomial system solving over C, Q, and Z/pZ. We also prove a result on Galois groups associated to sparse polynomial systems which may be of independent interest. A practical observation is that the aforementioned Diophantine problems should perhaps be avoided in the construction of crypto-systems.

Affiliated with

Also associated with

No associations

Rating

Computational Arithmetic Geometry I: Sentences Nearly in the Polynomial Hierarchy 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 Computational Arithmetic Geometry I: Sentences Nearly in the Polynomial Hierarchy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational Arithmetic Geometry I: Sentences Nearly in the Polynomial Hierarchy will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-231199