Size-depth tradeoffs for threshold circuits.
The following size-depth tradeoff for threshold circuits is obtained: any threshold circuit of depth d that computes the parity function on n variables must have at least n edges, where c > 0 and 0 < 3 are constants independent of n and d. Previously known constructions show that up to the cho...
| Julkaisussa: | SIAM journal on computing. 26, 3 (1997). |
|---|---|
| Päätekijä: | |
| Aineistotyyppi: | Artikkeli |
| Kieli: | English |
| Aiheet: |