Independence results in computer science
暂无分享,去创建一个
[1] Juris Hartmanis,et al. On the Structure of Feasible Computations , 1976, Adv. Comput..
[2] R. Solovay,et al. Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ Question , 1975 .
[3] John Gill,et al. Relativizations of the P =? NP Question , 1975, SIAM J. Comput..
[4] Juris Hartmanis,et al. On the Structure of Feasible Computation , 1974, GI Jahrestagung.
[5] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[6] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[7] Jeffrey D. Ullman,et al. Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.
[8] Manuel Blum,et al. A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.