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

Mika Göös, Pritish Kamath, Katerina Sotiraki +1

We study the search problem class ${\mathrm{PPA}}_q$ defined as a modulo-$q$ analog of the well-known $\text{polynomial parity argument}$ class $\mathrm{PPA}$ introduced by Papadim…