On Learning Embedded Midbit Functions
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Upper and Lower Bounds for Some Depth-3 Circuit Classes
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Quantum multiparty communication complexity and circuit lower bounds
Mathematical Structures in Computer Science
Depth Reduction for Circuits with a Single Layer of Modular Counting Gates
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
SIGACT news complexity theory column 64
ACM SIGACT News
Quantum multiparty communication complexity and circuit lower bounds
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
SIAM Journal on Computing
Testing (subclasses of) halfspaces
Property testing
Testing (subclasses of) halfspaces
Property testing
Nexp does not have non-uniform quasipolynomial-size ACC circuits of o(log log n) depth
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Counting, fanout and the complexity of quantum ACC
Quantum Information & Computation
Guest column: a casual tour around a circuit complexity bound
ACM SIGACT News
Hadamard tensors and lower bounds on multiparty communication complexity
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
On the correlation between parity and modular polynomials
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Algorithms for modular counting of roots of multivariate polynomials
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Interactive information complexity
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The multiparty communication complexity of set disjointness
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Decomposition of threshold functions into bounded fan-in threshold functions
Information and Computation
Hadamard tensors and lower bounds on multiparty communication complexity
Computational Complexity
Nonuniform ACC Circuit Lower Bounds
Journal of the ACM (JACM)
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.01 |
It is proved that any language in ACC can be approximately computed by two-level circuits of size 2 raised to the (log n)/sup k/ power, with a symmetric-function gate at the top and only AND gates on the first level. This implies that any language in ACC can be recognized by depth-3 threshold circuits of that size. This result gives the first nontrivial upper bound on the computing power of ACC circuits.