Levke Bentzien. Positive Turing and Truth-Table Completeness for NEXP Are Incomparable. In Lubos Brim, Jozef Gruska, Jirí Zlatuska, editors, Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS 98, Brno, Czech Republic, August 24-28, 1998, Proceedings. Volume 1450 of Lecture Notes in Computer Science, pages 474-482, Springer, 1998. [doi]
@inproceedings{Bentzien98,
title = {Positive Turing and Truth-Table Completeness for NEXP Are Incomparable},
author = {Levke Bentzien},
year = {1998},
url = {http://link.springer.de/link/service/series/0558/bibs/1450/14500474.htm},
tags = {completeness},
researchr = {https://researchr.org/publication/Bentzien98},
cites = {0},
citedby = {0},
pages = {474-482},
booktitle = {Mathematical Foundations of Computer Science 1998, 23rd International Symposium, MFCS 98, Brno, Czech Republic, August 24-28, 1998, Proceedings},
editor = {Lubos Brim and Jozef Gruska and Jirí Zlatuska},
volume = {1450},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-64827-5},
}