On One-One Polynomial Time Equivalence Relations
暂无分享,去创建一个
[1] Juris Hartmanis. On Sparse Sets in NP - P , 1983, Inf. Process. Lett..
[2] Juris Hartmanis,et al. On isomorphisms and density of NP and other complete sets , 1976, STOC '76.
[3] Paul Young,et al. Some structural properties of polynomial reducibilities and sets in NP , 1983, STOC.
[4] Juris Hartmanis,et al. On Isomorphisms and Density of NP and Other Complete Sets , 1977, SIAM J. Comput..
[5] Stephen R. Mahaney. Sparse complete sets for NP: Solution of a conjecture of Berman and Hartmanis , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[6] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[7] 守屋 悦朗,et al. J.E.Hopcroft, J.D. Ullman 著, "Introduction to Automata Theory, Languages, and Computation", Addison-Wesley, A5変形版, X+418, \6,670, 1979 , 1980 .
[8] R. L. Goodstein,et al. Theory of Recursive Functions and Effective Computability , 1969 .
[9] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .