When do extra majority gates help?
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Depth reduction for noncommutative arithmetic circuits
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Simulating threshold circuits by majority circuits
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A weight-size trade-off for circuits with MOD m gates
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The cost of the missing bit: communication complexity with help
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
ACM SIGACT News
Symmetric functions capture general functions
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Hadamard tensors and lower bounds on multiparty communication complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Interactive information complexity
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Separating deterministic from nondeterministic nof multiparty communication complexity
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
From information to exact communication
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Hadamard tensors and lower bounds on multiparty communication complexity
Computational Complexity
Isolating an Odd Number of Elements and Applications in Complexity Theory
Theory of Computing Systems
Frobenius's Degree Formula and Toda's Polynomials
Theory of Computing Systems
| Hi-index | 0.00 |
It has been shown by A. Yao (1990) that every language in ACC is recognized by a sequence of depth-2 probabilistic circuits with a symmetric gate at the root and n/sup polylog/(n) AND gates of fan-in polylog (n) at the leaves. The authors simplify Yao's proof and strengthen his results: every language in ACC is recognized by a sequence of depth-2 deterministic circuits with a symmetric gate at the root and n/sup polylog/(n) AND gates of fan-in polylog(n) at the leaves. They also analyze and improve modulus-amplifying polynomials constructed by S. Toda (1989) and Yao: this yields smaller circuits in Yao's and the present results on ACC.