Author:
Ambos-Spies Klaus,Yang Dongping
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. K.Ambos-Spies, On the structure of the polynomial time degrees of recursive sets (Habilitationsschrift), Tech. Rep. Nr. 206, Abteilung Informatik, Universität Dortmund.
2. K. Ambos-Spies, 1986 Inhomogeneities in the polynomial time degrees: the degrees of super sparse sets, Information Processing Letters 22,113–117.
3. K. Ambos-Spies, 1987 Minimal pairs for polynomial time reducibilities, in "Computation Theory and Logic" (E.Börger, ed.) Lecture Notes in Computer Science, vol. 270,1–13, Springer Verlag.
4. K. Ambos-Spies, 1989 Honest polynomial time reducibilities and the P=?NP problem, Journal of Computer and System Sciences 39, 250–281. [Extended Abstract: Honest polynomial reducibilities, recursively enumerable sets, and the P=?NP problem, in "Structure in Complexity Theory Second Annual Conference", IEEE Comput. Soc. Press, 1987, 60–68.]
5. K. Ambos-Spies,S. Homer and R.I. Soare, 1990 Minimal pairs and complete problems, in "STACS 90, Proceedings", Lecture Notes in Comput. Sci. 415, 24–36, Springer Verlag.