Klaus Ambos-Spies. Honest polynomial reducibilities, recursively enumerable sets, and the P=?NP problem. In Proceedings of the Second Annual Conference on Structure in Complexity Theory, Cornell University, Ithaca, New York, USA, June 16-19, 1987. pages 60-68, IEEE Computer Society, 1987.
Abstract is missing.