Klaus Ambos-Spies Honest Polynomial Time Reducibilities and the P = ? NP Problem. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1989, v:39, n:3, pp:250-281 [Journal]

Jim Kadin P^(NP[O(log n)]) and Sparse Turing-Complete Sets for NP. [Citation Graph (1, 0)][DBLP] J. Comput. Syst. Sci., 1989, v:39, n:3, pp:282-298 [Journal]