Monotone circuits for connectivity require super-logarithmic depth
暂无分享,去创建一个
[1] V. M. Khrapchenko. Method of determining lower bounds for the complexity of P-schemes , 1971 .
[2] Richard J. Lipton,et al. Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[3] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.
[4] Walter L. Ruzzo,et al. Tree-size bounded alternation(Extended Abstract) , 1979, J. Comput. Syst. Sci..
[5] Michael Sipser,et al. Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[6] Miklós Ajtai,et al. ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..
[7] János Komlós,et al. An 0(n log n) sorting network , 1983, STOC.
[8] Leslie G. Valiant,et al. Short Monotone Formulae for the Majority Function , 1984, J. Algorithms.
[9] Mihalis Yannakakis,et al. On monotone formulae with restricted depth , 1984, STOC '84.
[10] A. Yao. Separating the polynomial-time hierarchy by oracles , 1985 .
[11] Johan Håstad,et al. Almost optimal lower bounds for small depth circuits , 1986, STOC '86.
[12] Noga Alon,et al. The monotone circuit complexity of boolean functions , 1987, Comb..
[13] Béla Bollobás,et al. Threshold functions , 1987, Comb..