A Degree-Decreasing Lemma for (MOD_q-MOD_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 (MOD_q,MOD_p) circ...
Main Author: | |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2001-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/289/pdf |
Search Result 1
A Degree-Decreasing Lemma for (M O D q- M O D p) Circuits
Published 2001-12-01
Get full text
Article