论文信息 - The Theory of the Polynomial Many-One Degrees of Recursive Sets is Undecidable - 字舞流文

The Theory of the Polynomial Many-One Degrees of Recursive Sets is Undecidable

Klaus Ambos-Spies | André Nies

[1] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

[2] Richard A. Shore,et al. The P-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two quantifier theory , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[3] E. Börger. Computation Theory and Logic , 1987, Lecture Notes in Computer Science.

[4] Klaus Ambos-Spies. Minimal Pairs for Polynomial Time Reducibilities , 1987, Computation Theory and Logic.

[5] Kurt Mehlhorn. Polynomial and Abstract Subrecursive Classes , 1976, J. Comput. Syst. Sci..

[6] Richard E. Ladner,et al. On the Structure of Polynomial Time Reducibility , 1975, JACM.

[7] André Nies,et al. The Theory of the Recursively Enumerable Weak Truth-Table Degrees Is Undecidability , 1992, J. Symb. Log..

[8] Richard J. Lipton,et al. On the Structure of Sets in NP and Other Complexity Classes , 1981, Theor. Comput. Sci..

[9] Stanley Burris,et al. Decidability and Boolean Representations , 1981 .

[10] Klaus Ambos-Spies. An Inhomogeneity in the Structure of Karp Degrees , 1986, SIAM J. Comput..

[11] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .

[12] Klaus Ambos-Spies. On the Structure of Polynomial Time Degrees , 1984, STACS.