With Quasi-linear Queries, EXP is not Polynomial Time Turing Reducible to ?Sparse Sets

Bin Fu. With Quasi-linear Queries, EXP is not Polynomial Time Turing Reducible to ?Sparse Sets. In Structure in Complexity Theory Conference. pages 185-191, 1993.

Abstract

Abstract is missing.