On the Complexity of Modulo-q Arguments and the Chevalley-Warning Theorem
Mika Göös,
Pritish Kamath,
Katerina Sotiraki
et al.
Abstract: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 (JCSS 1994). 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 … Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.