A Degree-Decreasing Lemma for (M O D q- M O D p) Circuits
Consider a (MOD q, MOD p) circuit, where the inputs of the bottom MOD p 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...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2001-12-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Online Access: | http://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/145 |
| Summary: | Consider a (MOD q, MOD p) circuit, where the inputs of the bottom MOD p 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 (MOD q, MOD p) 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 (MOD q, MOD p) circuits computing the n fan-in AND, where the input of each MOD p gate at the bottom is an arbitrary integer valued function of cn variables (c<1) plus an arbitrary linear function of n input variables. |
|---|---|
| ISSN: | 1462-7264 1365-8050 |