ON ACC and threshold circuits

@article{Yao1990ONAA,
  title={ON ACC and threshold circuits},
  author={A. Yao},
  journal={Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science},
  year={1990},
  pages={619-627 vol.2}
}
  • A. Yao
  • Published 1990
  • Mathematics, Computer Science
  • Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
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.<<ETX>> 
236 Citations

Topics from this paper

The power of the middle bit
  • 20
  • PDF
On ACC (circuit complexity)
  • R. Beigel, Jun Tarui
  • Mathematics, Computer Science
  • [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
  • 1991
  • 24
  • PDF
On the power of small-depth threshold circuits
  • J. Håstad, M. Goldmann
  • Mathematics, Computer Science
  • Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
  • 1990
  • 109
  • PDF
NEXP Does Not Have Non-uniform Quasipolynomial-Size ACC Circuits of o(loglogn) Depth
  • 9
On the power of small-depth threshold circuits
  • 145
  • PDF
A Uniform Circuit Lower Bound for the Permanent
  • 47
  • PDF
Computing Threshold Functions by Depth-3 Threshold Circuits with Smaller Thresholds of Their Gates
  • S. Jukna
  • Mathematics, Computer Science
  • Inf. Process. Lett.
  • 1995
  • 7
n^Omega(log n) Lower Bounds on the Size of Depth-3 Threshold Circuits with AND Gates at the Bottom
  • 55
  • PDF
E cient Threshold Circuits for Power
A Lower Bound for Depth-3 Circuits with MOD m Gates
  • V. Grolmusz
  • Mathematics, Computer Science
  • Inf. Process. Lett.
  • 1998
  • 5
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 19 REFERENCES
A note on the power of threshold circuits
  • E. Allender
  • Mathematics, Computer Science
  • 30th Annual Symposium on Foundations of Computer Science
  • 1989
  • 165
  • PDF
On the power of small-depth threshold circuits
  • J. Håstad, M. Goldmann
  • Mathematics, Computer Science
  • Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science
  • 1990
  • 109
  • PDF
On the Power of Uniform Families of Constant Depth Treshold Circuits
  • 47
Parity, circuits, and the polynomial-time hierarchy
  • M. Furst, J. Saxe, M. Sipser
  • Mathematics, Computer Science
  • 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)
  • 1981
  • 850
Almost optimal lower bounds for small depth circuits
  • J. Håstad
  • Computer Science, Mathematics
  • STOC '86
  • 1986
  • 784
  • PDF
On the computational power of PP and (+)P
  • Seinosuke Toda
  • Mathematics, Computer Science
  • 30th Annual Symposium on Foundations of Computer Science
  • 1989
  • 269
  • PDF
Algebraic methods in the theory of lower bounds for Boolean circuit complexity
  • 818
  • PDF
Harmonic Analysis of Polynomial Threshold Functions
  • 206
  • PDF
...
1
2
...