Abstract
We present a function in ACC0 such that any depth-3 threshold circuit which computes this function and has AND gates at the bottom must have size nω(log n).
Original language | English |
---|---|
Pages (from-to) | 303-307 |
Number of pages | 5 |
Journal | Information Processing Letters |
Volume | 45 |
Issue number | 6 |
DOIs | |
State | Published - 16 Apr 1993 |
Keywords
- Computational complexity
- lower bounds
- threshold circuits