@article{blass1984equivalence,
author = {Blass, Andreas and Gurevich, Yuri},
title = {Equivalence Relations, Invariants, and Normal Forms, II},
year = {1984},
month = {April},
abstract = {We consider the questions whether polynomial time solutions for the easier problems of the list for 55 yield NP solutions for the harder ones, or vice versa. We show that affirmative answers to several of these questions are equivalent to natural principles like NP = co-NP, (NP intersect co-NP) = P, and the shrinking principle for NP sets. We supplement known oracles with enough new ones to show that all questions considered have negative answers relative to some oracles. In other words, these questions cannot be answered affirmatively by means of relativizable polynomial-time Turing reductions. Finally, we show that the analogous questions in the framework where Borel sets play the role of polynomial time decidable sets have negative answers.},
url = {http://approjects.co.za/?big=en-us/research/publication/equivalence-relations-invariants-normal-forms-ii/},
pages = {24-42},
journal = {Springer Lecture Notes in Computer Science},
volume = {171},
}