| |
| 2000 | ||
|---|---|---|
| 3 | Klaus Ambos-Spies, Levke Bentzien: Separating NP-Completeness Notions under Strong Hypotheses. J. Comput. Syst. Sci. 61(3): 335-361 (2000) | |
| 1998 | ||
| 2 | EE | Levke Bentzien: Positive Turing and Truth-Table Completeness for NEXP Are Incomparable. MFCS 1998: 474-482 |
| 1997 | ||
| 1 | EE | Klaus Ambos-Spies, Levke Bentzien: Separating NP-Completeness Notions under Strong Hypotheses. IEEE Conference on Computational Complexity 1997: 121-127 |
| 1 | Klaus Ambos-Spies | [1] [3] |