## Discrete Mathematics & Theoretical Computer Science, Vol 4, No 2 (2001)

Font Size:
DMTCS vol 4 no 2 (2001), pp. 247-254

# Discrete Mathematics & Theoretical Computer Science

## Volume 4 n° 2 (2001), pp. 247-254

author: Vince Grolmusz A Degree-Decreasing Lemma for (MODq-MODp) Circuits Circuit complexity, modular circuits, composite modulus, Constant Degree Hypothesis Consider a (MODq,MODp) circuit, where the inputs of the bottom MODp gates are degree-d polynomials with integer coefficients of the input variables (p, q are different primes). Using our main tool --- the Degree Decreasing Lemma --- we show that this circuit can be converted to a (MODq,MODp) circuit with linear polynomials on the input-level with the price of increasing the size of the circuit. This result has numerous consequences: for the Constant Degree Hypothesis of Barrington, Straubing and Thérien, and generalizing the lower bound results of Yan and Parberry, Krause and Waack, and Krause and Pudlák. Perhaps the most important application is an exponential lower bound for the size of (MODq,MODp) circuits computing the n fan-in AND, where the input of each MODp gate at the bottom is an arbitrary integer valued function of cn variables (c<1) plus an arbitrary linear function of n input variables. If your browser does not display the abstract correctly (because of the different mathematical symbols) you can look it up in the PostScript or PDF files. Vince Grolmusz (2001), A Degree-Decreasing Lemma for (MODq-MODp) Circuits, Discrete Mathematics and Theoretical Computer Science 4, pp. 247-254 For a corresponding BibTeX entry, please consider our BibTeX-file. dm040213.ps.gz (38 K) dm040213.ps (195 K) dm040213.pdf (81 K)