<p>Perhaps this isn't really an answer to your question. But to just give one example of why sometimes $\bmod m$ gates (for composite $m$) are more powerful than $\bmod p$ gates:</p>

<p>Consider the class of constant depth circuits that consist <em>only</em> of $\bmod p$ gates, and inputs and constants at the leaves. Then, one can easily show that the OR function (for example) cannot be computed by such circuits, regardless of the size of the circuit. (This is because any such circuit computes a low degree polynomial over $\mathbb{F}_p$, and the degree of OR is $n$).</p>

<p>However, if we consider circuits that consist only of $\bmod m$ gates where $m$ has at least two distinct prime factors, there is a depth $2$ circuit (of exponential size) for the OR function. </p>

<p>And prior to Ryan's result, $AC^0[\bmod 6]$ was I guess the smallest class for which we didn't have any decent lower bounds. </p>

CC BY-SA 2.5
2010-11-10T16:10:42.247Z
Addendum to the last sentence: [It was already known](http://portal.acm.org/citation.cfm?doid=28395.28404) that computing $MOD_q$ with constant-depth circuits using AND, OR, NOT, and $MOD_p$ gates for primes $p \ne q$ required an exponential number of gates. (There's an extension to relatively prime composites as well.) Since 6 is the smallest composite of two distinct primes, $MOD_6$ is the "easiest"-to-compute function that no exponential lower bound was known for.
Daniel Apon
CC BY-SA 2.5
2010-11-09T16:57:05.067Z
2010-11-09T16:57:05.067Z
Ramprasad
<p>Just to elaborate on your two points:</p>

<p>If we are in the business of understanding computation, modular counting is one of the frontiers of our understanding. Modular counting is one of the simplest and most natural phenomena in computation, yet we seem to understand so little about it. We cannot rule out the possibility that polynomial size depth 3 circuits with just Mod6 gates can compute every function in NP. It is conjectured however that such circuits can only compute functions with large support size and hence cannot compute a very simple function like AND. At the upper bound side the situation is similar, we have no non-trivial results.</p>

<p>These questions are also very interesting from a purely mathematical perspective as they are closely linked to very natural questions about polynomials and matrices over Z_m. To give one example, we don't have good lower bounds for the rank of a nxn codiagonal matrix over Z_6. A codiagonal matrix has 0s on the diagonal and nonzeros off diagonal.</p>

CC BY-SA 3.0
2011-07-07T22:25:02.007Z
Those interested in "prime versus composite modulo" should check  the home page of Vince Grolmusz: http://grolmusz.pitgroup.org
Stasys
CC BY-SA 2.5
2010-11-09T23:13:41.657Z
2010-11-09T23:13:41.657Z
aada
<p>$ACC^0$ is a natural complexity class.</p>

<p>1) Barrington showed that computation over non-solvable monoids capture $NC^1$ while over solvable monoids capture $ACC^0$.</p>

<p>2) Recently, Hansen and Koucky <a href="http://doi.ieeecomputersociety.org/10.1109/CCC.2009.15"> proved </a> a beautiful result that poly-sized constant width planar branching programs are exactly $ACC^0$. Without the planarity condition, we of course get Barrington's result characterizing $NC^1$. </p>

<p>So the difference between $ACC^0$ and $NC^1$ is group-theoretic on one hand and topological on the other.</p>

<p><b>Added:</b> Dana, a simple example of a solvable group is $S_4$, the symmetric group over elements. Without getting into details, any solvable group has a series whose quotients happen to be cyclic. This cyclic structure gets reflected as mod gates while building a circuit to solve word problems over the group. </p>

<p>On planarity, one would like to believe that planarity may impose restrictions/bottlenecks in the flow of information. This is not always true: for example, variations of planar 3SAT are known to be NP-complete. However, in smaller classes, these restrictions are more "likely" to hold. </p>

<p>In similar vein, Wigderson showed NL/poly=UL/poly using the isolation lemma. We do not know how to derandomize the isolation lemma over arbitrary DAGs to get NL=UL, but we know how to do so for <a href="http://doi.acm.org/10.1145/1490270.1490274">planar DAGs.</a> </p>

CC BY-SA 3.0
2011-07-08T21:22:23.467Z
@Vinay: Are you sure that the result NL/poly=UL/poly is due to Wigderson?
Dai Le
CC BY-SA 2.5
2010-11-09T15:15:05.310Z
Thanks a lot for the information! I'd love to hear more about the intuition for these results. As to my question: your argument is basically that $NC^1$ [O(log n) depth, gates AND, OR, NOT] is natural, and $ACC$ is a slight variation of it (to solvable rather than non-solvable monoids, or to planar rather than non-planar branching programs). Could you elaborate a little: give examples of interesting monoids for computation, and how their solvability matters? Is there an a-priori motivation to take interest in whether a branching program is planar or not?
Dana Moshkovitz
CC BY-SA 2.5
2010-11-09T15:55:05.103Z
To complement: 1) Computation over aperiodic monoids capture $AC^0$ (Barrington and Thérien). 2) Upward planar branching programs capture $AC^0$ (Barrington, Lu, Miltersen, Skyum).
Kristoffer Arnsfelt Hansen
CC BY-SA 2.5
2010-11-09T14:32:10.867Z
2010-11-10T03:34:37.640Z
2010-11-10T03:34:37.640Z
V Vinay
<p>Ryan Williams just posted his <a href="http://www.cs.cmu.edu/~ryanw/acc-lbs.pdf">lower bound on ACC</a>, the class of problems that have constant depth circuits with unbounded fan-in and gates AND, OR, NOT and MOD_m for all possible m's.</p>

<p>What's so special about MOD_m gates?</p>

<ul>
<li>They allow one to simulate arithmetic over any ring Z_m.</li>
<li>Before Ryan's result, throwing MOD_m gates to the mix gave the first class for which the known lower bounds did not work.</li>
</ul>

<p>Is there any other natural reason to study MOD_m gates?</p>

<cc.complexity-theory><circuit-complexity><big-picture><circuit-families>
Why are mod_m gates interesting?
Dana Moshkovitz
# Why are mod_m gates interesting?

(Asked by: username_0 on 2010-11-09)

Ryan Williams just posted his [lower bound on ACC](http://www.cs.cmu.edu/~ryanw/acc-lbs.pdf), the class of problems that have constant depth circuits with unbounded fan-in and gates AND, OR, NOT and MOD\_m for all possible m's.

What's so special about MOD\_m gates?

* They allow one to simulate arithmetic over any ring Z\_m.
* Before Ryan's result, throwing MOD\_m gates to the mix gave the first class for which the known lower bounds did not work.

Is there any other natural reason to study MOD\_m gates?

**Tags:** cc.complexity-theory, circuit-complexity, big-picture, circuit-families


---

## 3 answers

### Answer by username_5 on 2010-11-09. Score: 39 | Accepted answer

$ACC^0$ is a natural complexity class.

1) Barrington showed that computation over non-solvable monoids capture $NC^1$ while over solvable monoids capture $ACC^0$.

2) Recently, Hansen and Koucky  [proved](http://doi.ieeecomputersociety.org/10.1109/CCC.2009.15)  a beautiful result that poly-sized constant width planar branching programs are exactly $ACC^0$. Without the planarity condition, we of course get Barrington's result characterizing $NC^1$.

So the difference between $ACC^0$ and $NC^1$ is group-theoretic on one hand and topological on the other.

**Added:** Dana, a simple example of a solvable group is $S\_4$, the symmetric group over elements. Without getting into details, any solvable group has a series whose quotients happen to be cyclic. This cyclic structure gets reflected as mod gates while building a circuit to solve word problems over the group.

On planarity, one would like to believe that planarity may impose restrictions/bottlenecks in the flow of information. This is not always true: for example, variations of planar 3SAT are known to be NP-complete. However, in smaller classes, these restrictions are more "likely" to hold.

In similar vein, Wigderson showed NL/poly=UL/poly using the isolation lemma. We do not know how to derandomize the isolation lemma over arbitrary DAGs to get NL=UL, but we know how to do so for [planar DAGs.](http://doi.acm.org/10.1145/1490270.1490274)

> **Comments:**
> **username_0**: Thanks a lot for the information! I'd love to hear more about the intuition for these results. As to my question: your argument is basically that $NC^1$ [O(log n) depth, gates AND, OR, NOT] is natural, and $ACC$ is a slight variation of it (to solvable rather than non-solvable monoids, or to planar rather than non-planar branching programs). Could you elaborate a little: give examples of interesting monoids for computation, and how their solvability matters? Is there an a-priori motivation to take interest in whether a branching program is planar or not?  
> **username_7**: To complement: 1) Computation over aperiodic monoids capture $AC^0$ (Barrington and Thérien). 2) Upward planar branching programs capture $AC^0$ (Barrington, Lu, Miltersen, Skyum).  
> **username_6**: @Vinay: Are you sure that the result NL/poly=UL/poly is due to Wigderson?  

---

### Answer by username_1 on 2010-11-09. Score: 17

Perhaps this isn't really an answer to your question. But to just give one example of why sometimes $\bmod m$ gates (for composite $m$) are more powerful than $\bmod p$ gates:

Consider the class of constant depth circuits that consist *only* of $\bmod p$ gates, and inputs and constants at the leaves. Then, one can easily show that the OR function (for example) cannot be computed by such circuits, regardless of the size of the circuit. (This is because any such circuit computes a low degree polynomial over $\mathbb{F}\_p$, and the degree of OR is $n$).

However, if we consider circuits that consist only of $\bmod m$ gates where $m$ has at least two distinct prime factors, there is a depth $2$ circuit (of exponential size) for the OR function.

And prior to Ryan's result, $AC^0[\bmod 6]$ was I guess the smallest class for which we didn't have any decent lower bounds.

> **Comments:**
> **username_2**: Addendum to the last sentence: [It was already known](http://portal.acm.org/citation.cfm?doid=28395.28404) that computing $MOD_q$ with constant-depth circuits using AND, OR, NOT, and $MOD_p$ gates for primes $p \ne q$ required an exponential number of gates. (There's an extension to relatively prime composites as well.) Since 6 is the smallest composite of two distinct primes, $MOD_6$ is the "easiest"-to-compute function that no exponential lower bound was known for.  

---

### Answer by username_3 on 2010-11-09. Score: 14

Just to elaborate on your two points:

If we are in the business of understanding computation, modular counting is one of the frontiers of our understanding. Modular counting is one of the simplest and most natural phenomena in computation, yet we seem to understand so little about it. We cannot rule out the possibility that polynomial size depth 3 circuits with just Mod6 gates can compute every function in NP. It is conjectured however that such circuits can only compute functions with large support size and hence cannot compute a very simple function like AND. At the upper bound side the situation is similar, we have no non-trivial results.

These questions are also very interesting from a purely mathematical perspective as they are closely linked to very natural questions about polynomials and matrices over Z\_m. To give one example, we don't have good lower bounds for the rank of a nxn codiagonal matrix over Z\_6. A codiagonal matrix has 0s on the diagonal and nonzeros off diagonal.

> **Comments:**
> **username_4**: Those interested in "prime versus composite modulo" should check  the home page of Vince Grolmusz: http://grolmusz.pitgroup.org  

---

