Circuit Lower Bounds à la Kolmogorov
暂无分享,去创建一个
[1] Michael Sipser,et al. Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[2] A. Yao. Separating the polynomial-time hierarchy by oracles , 1985 .
[3] Johan Håstad,et al. Almost optimal lower bounds for small depth circuits , 1986, STOC '86.
[4] Ravi B. Boppana,et al. The Complexity of Finite Functions , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[5] Paul M. B. Vitányi,et al. An Introduction to Kolmogorov Complexity and Its Applications , 1993, Graduate Texts in Computer Science.
[6] A. Razborov. Bounded Arithmetic and Lower Bounds in Boolean Complexity , 1995 .