Klaus Ambos-Spies. On the Relative Complexity of Hard Problems for Complexity Classes without Complete Problems. Theoretical Computer Science, 63(1):43-61, 1989.
@article{Ambos-Spies89-0,
title = {On the Relative Complexity of Hard Problems for Complexity Classes without Complete Problems},
author = {Klaus Ambos-Spies},
year = {1989},
tags = {completeness},
researchr = {https://researchr.org/publication/Ambos-Spies89-0},
cites = {0},
citedby = {0},
journal = {Theoretical Computer Science},
volume = {63},
number = {1},
pages = {43-61},
}