Modular gates are known to be immune for the random restriction techniques of Ajtai, Furst, Saxe, Sipser, Yao and Hadstad. We demonstrate here a random clustering technique which overcomes this difficulty and is capable to prove generalizations of several known modular circuit lower bounds of Barrington, Straubing, Therien, Krause and Pudlak, and others, characterizing symmetric functions computable by small (MODp, ANDt, MODm) circuits. Applying a degree-decreasing technique together with random restriction methods for the AND gates at the bottom level, we also prove a hard special case of the Constant Degree Hypothesis of Barrington, Straubing, Therien, and other related lower bounds for certain (MODp, MODm, AND) circuits. Most of the previous lower bounds on circuits with modular gates used special definitions of the modular gates (i.e., the gate outputs one if the sum of its inputs is divisible by m, or is not divisible by m), and were not valid for more general MODm gates. Our methods are applicable - and our lower bounds are valid - for the most general modular gates as well.
|Number of pages||10|
|Journal||Annual Symposium on Foundations of Computer Science - Proceedings|
|Publication status||Published - Dec 1 1998|
|Event||Proceedings of the 1998 39th Annual Symposium on Foundations of Computer Science - Palo Alto, CA, USA|
Duration: Nov 8 1998 → Nov 11 1998
ASJC Scopus subject areas
- Hardware and Architecture