Geodesic
A Degree-Decreasing Lemma for (MOD_q-MOD_p) Circuits
Discrete mathematics & theoretical computer science, Tome 4 (2000-2001) no. 2.

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_2001_4_2_a16,
     author = {Grolmusz, Vince},
     title = {A {Degree-Decreasing} {Lemma} for {(MOD_q-MOD_p)} {Circuits}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {4},
     number = {2},
     year = {2000-2001},
     doi = {10.46298/dmtcs.289},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.289/}
}
TY  - JOUR
AU  - Grolmusz, Vince
TI  - A Degree-Decreasing Lemma for (MOD_q-MOD_p) Circuits
JO  - Discrete mathematics & theoretical computer science
PY  - 2000-2001
VL  - 4
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.289/
DO  - 10.46298/dmtcs.289
LA  - en
ID  - DMTCS_2001_4_2_a16
ER  - 
%0 Journal Article
%A Grolmusz, Vince
%T A Degree-Decreasing Lemma for (MOD_q-MOD_p) Circuits
%J Discrete mathematics & theoretical computer science
%D 2000-2001
%V 4
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.289/
%R 10.46298/dmtcs.289
%G en
%F DMTCS_2001_4_2_a16
Grolmusz, Vince. A Degree-Decreasing Lemma for (MOD_q-MOD_p) Circuits. Discrete mathematics & theoretical computer science, Tome 4 (2000-2001) no. 2. doi : 10.46298/dmtcs.289. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.289/

Cité par Sources :