Regular Article
Depth Reduction for Circuits of Unbounded Fan-in

https://doi.org/10.1006/inco.1994.1057Get rights and content
Under an Elsevier user license
open archive

Abstract

We prove that constant depth circuits of size nlogO(1)n over the basis AND, OR, PARITY are no more powerful than circuits of this size with depth four. Similar techniques are used to obtain several other depth reduction theorems; in particular, we show every set in AC0 can be recognized by a family of depth-three threshold circuits of size nlogO(1)n. The size bound nlogO(1)n is optimal when considering depth reduction over AND, OR, and PARITY. Most of our results hold for both the uniform and the nonuniform case.

Cited by (0)