Complexity-Theoretic Algebra II: Boolean Algebras
暂无分享,去创建一个
[1] Jin-Yi Cai. On Some Most Probable Separations of Complexity Classes , 1986 .
[2] Uwe Schöning,et al. Complexity and Structure , 1986, Lecture Notes in Computer Science.
[3] Andrew Chi-Chih Yao,et al. Separating the Polynomial-Time Hierarchy by Oracles (Preliminary Version) , 1985, FOCS.
[4] Wolfgang Maass,et al. Oracle-Dependent Properties of the Lattice of NP Sets , 1983, Theor. Comput. Sci..
[5] John Gill,et al. Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..
[6] J. Remmel. Recursion theory on algebraic structures with independent sets , 1980 .
[7] Jeffrey B. Remmel,et al. On r.e. and co-r.e. vector spaces with nonextendible bases , 1980, Journal of Symbolic Logic.
[8] A. Nerode,et al. Effective content of field theory , 1979 .
[9] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[10] J. Remmel. Recursively enumerable Boolean algebras , 1978 .
[11] Seth Breidbart. On Splitting Recursive Sets , 1978, J. Comput. Syst. Sci..
[12] Iraj Kalantari,et al. Automorphisms of the Lattice of Recursively Enumerable Vector Spaces , 1979, Math. Log. Q..
[13] A. Nerode,et al. Recursively enumerable vector spaces , 1977 .
[14] R. Solovay,et al. Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .
[15] A. Nerode,et al. Recursion theory and algebra , 1975 .
[16] J. C. E. Dekker. Two notes on vector spaces with recursive operations , 1971, Notre Dame J. Formal Log..
[17] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[18] Stephen A. Cook,et al. Review: Alan Cobham, Yehoshua Bar-Hillel, The Intrinsic Computational Difficulty of Functions , 1969 .
[19] Donald A. Martin,et al. Classes of Recursively Enumerable Sets and Degrees of Unsolvability , 1966 .
[20] J. Hartmanis,et al. On the Computational Complexity of Algorithms , 1965 .
[21] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.