Lower bounds for modular counting by circuits with modular gates

Abstract

We prove that constant depth circuits, with one layer of MOD m gates at the inputs, followed by a fixed number of layers of MOD p gates, where p is prime, require exponential size to compute the MOD q function, if q is a prime that divides neither p nor q.