论文信息 - The Complexity of Symmetric Functions in Bounded-Depth Circuits - 字舞流文

The Complexity of Symmetric Functions in Bounded-Depth Circuits

Abstract We give a simple description of all symmetric functions which can be computed efficiently by circuits of small depth and unbounded fan-in.

Ingo Wegener | Bettina Brustmann

[1] Ingo Wegener,et al. Properties of Complexity Measures for Prams and Wrams , 1986, Theor. Comput. Sci..

[2] Michael Ben-Or,et al. A theorem on probabilistic constant depth Computations , 1984, STOC '84.

[3] Ronald Fagin,et al. Bounded-Depth, Polynomial-Size Circuits for Symmetric Functions , 1985, Theoretical Computer Science.

[4] Johan Håstad,et al. Almost optimal lower bounds for small depth circuits , 1986, STOC '86.

[5] Andrew Chi-Chih Yao,et al. Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version) , 1985, FOCS.