Lower Bounds for the Size of Circuits of Bounded Depth in Basis F^; G
暂无分享,去创建一个
[1] Michael Sipser,et al. Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[2] Leslie G. Valiant,et al. Exponential lower bounds for restricted monotone circuits , 1983, STOC.
[3] Norbert Blum. A Boolean Function Requiring 3n Network Size , 1984, Theor. Comput. Sci..
[4] A. Razborov. Lower bounds on monotone complexity of the logical permanent , 1985 .
[5] A. Yao. Separating the polynomial-time hierarchy by oracles , 1985 .
[6] Ravi B. Boppana,et al. Threshold Functions and Bounded Depth Monotone Circuits , 1986, J. Comput. Syst. Sci..