Service interruption on Monday 11 July from 12:30 to 13:00: all the sites of the CCSD (HAL, Epiciences, SciencesConf, AureHAL) will be inaccessible (network hardware connection).
Skip to Main content Skip to Navigation
Journal articles

A Degree-Decreasing Lemma for (MOD_q-MOD_p) Circuits

Abstract : 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 \emphlinear 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 \empharbitrary integer valued function of cn variables (c<1) plus an arbitrary linear function of n input variables.
Document type :
Journal articles
Complete list of metadata

Cited literature [22 references]  Display  Hide  Download
Contributor : Service Ist Inria Sophia Antipolis-Méditerranée / I3s Connect in order to contact the contributor
Submitted on : Thursday, March 13, 2014 - 4:53:28 PM
Last modification on : Wednesday, November 29, 2017 - 10:26:23 AM
Long-term archiving on: : Friday, June 13, 2014 - 12:09:28 PM


Files produced by the author(s)




Vince Grolmusz. A Degree-Decreasing Lemma for (MOD_q-MOD_p) Circuits. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2001, Vol. 4 no. 2 (2), pp.247-254. ⟨10.46298/dmtcs.289⟩. ⟨hal-00958960⟩



Record views


Files downloads