Jim Kadin. NP[log n] and sparse turing complete sets for NP. In Proceedings of the Second Annual Conference on Structure in Complexity Theory, Cornell University, Ithaca, New York, USA, June 16-19, 1987. pages 33-40, IEEE Computer Society, 1987.
Abstract is missing.