Finitary substructure languages with application to the theory of NP-completeness
暂无分享,去创建一个
[1] Juris Hartmanis,et al. On Isomorphisms and Density of NP and Other Complete Sets , 1977, SIAM J. Comput..
[2] Richard J. Lipton,et al. Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.
[3] Leslie G. Valiant,et al. A theory of the learnable , 1984, STOC '84.
[4] Deborah Joseph,et al. Some Remarks on Witness Functions for Nonpolynomial and Noncomplete Sets in NP , 1985, Theor. Comput. Sci..
[5] Stephen R. Mahaney. Sparse Complete Sets of NP: Solution of a Conjecture of Berman and Hartmanis , 1982, J. Comput. Syst. Sci..
[6] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[7] Timothy J. Long,et al. A Note on Sparse Oracles for NP , 1982, J. Comput. Syst. Sci..
[8] Stuart A. Kurtz,et al. The isomorphic conjecture fails relative to a random oracle , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.
[9] Stuart A. Kurtz,et al. The ismorphism conjecture fails relative to a random oracle , 1989, STOC '89.
[10] Ker-I Ko,et al. On sets reducible to sparse sets , 1987, Computational Complexity Conference.