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 |