Parity, circuits, and the polynomial-time hierarchy
暂无分享,去创建一个
[1] L. Hodes,et al. Implementing the Algebra of Logic Functions in Terms of Bounded Depth Formulas in the Basis of , 1961 .
[2] Albert R. Meyer,et al. Word problems requiring exponential time(Preliminary Report) , 1973, STOC.
[3] R. Solovay,et al. Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .
[4] Larry J. Stockmeyer,et al. The Polynomial-Time Hierarchy , 1976, Theor. Comput. Sci..
[5] A. K. Chandra,et al. Alternation , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).
[6] Theodore P. Baker,et al. A Second Step toward the Polynomial Hierarchy , 1976, FOCS.
[7] Claus-Peter Schnorr. A 3n-Lower Bound on the Network Complexity of Boolean Functions , 1980, Theor. Comput. Sci..
[8] Dana Angluin,et al. On Counting Problems and the Polynomial-Time Hierarchy , 1980, Theor. Comput. Sci..
[9] Leslie G. Valiant,et al. A complexity theory based on Boolean algebra , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).