On the Complexity of Modulo-q Arguments and the Chevalley-Warning Theorem

by   Mika Göös, et al.

We study the search problem class PPA_q defined as a modulo-q analog of the well-known polynomial parity argument class PPA introduced by Papadimitriou '94. Our first result shows that this class can be characterized in terms of PPA_p for prime p. Our main result is to establish that an explicit version of a search problem associated to the Chevalley–Warning theorem is complete for PPA_p for prime p. This problem is natural in that it does not explicitly involve circuits as part of the input. It is the first such complete problem for PPA_p when p > 3. Finally we discuss connections between Chevalley-Warning theorem and the well-studied short integer solution problem and survey the structural properties of PPA_q.


page 1

page 2

page 3

page 4


Extremal combinatorics, iterated pigeonhole arguments, and generalizations of PPP

We study the complexity of computational problems arising from existence...

Arrow's Theorem Through a Fixpoint Argument

We present a proof of Arrow's theorem from social choice theory that use...

On the Polynomial Parity Argument Complexity of the Combinatorial Nullstellensatz

The complexity class PPA consists of NP-search problems which are reduci...

Primality Tests and Prime Certificate

This note presents a formalisation done in Coq of Lucas-Lehmer test and ...

Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem

In the consensus halving problem we are given n agents with valuations o...

Formalizing a Diophantine Representation of the Set of Prime Numbers

The DPRM (Davis-Putnam-Robinson-Matiyasevich) theorem is the main step i...

Scientific versus statistical modelling: a unifying approach

This paper addresses two fundamental features of quantities modeled and ...