On the Relative Complexity of Hard Problems for Complexity Classes without Complete Problems

Klaus Ambos-Spies. On the Relative Complexity of Hard Problems for Complexity Classes without Complete Problems. Theoretical Computer Science, 63(1):43-61, 1989.

Authors

Klaus Ambos-Spies

This author has not been identified. Look up 'Klaus Ambos-Spies' in Google