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.
@inproceedings{Ambos-Spies87-0,
title = {Honest polynomial reducibilities, recursively enumerable sets, and the P=?NP problem},
author = {Klaus Ambos-Spies},
year = {1987},
researchr = {https://researchr.org/publication/Ambos-Spies87-0},
cites = {0},
citedby = {0},
pages = {60-68},
booktitle = {Proceedings of the Second Annual Conference on Structure in Complexity Theory, Cornell University, Ithaca, New York, USA, June 16-19, 1987},
publisher = {IEEE Computer Society},
}