Name
Abstract | ||
|---|---|---|
We give a new proof of recent results of Grolmusz and Tardos on the computing power of constant-depth circuits consisting of a single layer of $MOD_m$ gates followed by a fixed number of layers of $MOD_{p^k}$ -gates, where p is prime. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/s00224-004-1210-2 | Theory Comput. Syst. |
Keywords | DocType | Volume |
Symmetric Function,Exponential Size,Symmetric Boolean Function,Circuit Family,Polynomial Time Hierarchy | Journal | 39 |
Issue | ISSN | Citations |
5 | 1432-4350 | 5 |
PageRank | References | Authors |
0.43 | 4 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Howard Straubing | 1 | 528 | 60.92 |
| Denis Thérien | 2 | 671 | 55.71 |