O(1) (1991)
Download:
|
|
by Ulrich Hertrampf, Eric Allender, Eric Allender
ftp://ftp.cs.rutgers.edu/pub/allender/ic.ps.Z
Add To MetaCart
Abstract:
Abstract. We prove that constant depth circuits of size n log
Citations
| 98 | Two theorems on random polynomial time – Adleman - 1978 |
| 84 | A note on the power of threshold circuits – Allender - 1989 |
| 44 | A theorem on probabilistic constant depth computations – Ajtai, Ben-Or - 1984 |
| 39 | P-uniform circuit complexity – Allender - 1989 |
