With quasi-linear queries, EXP is not polynomial time Turing reducible to sparse sets

With quasi-linear queries, EXP is not polynomial time Turing reducible to sparse sets | IEEE Conference Publication | IEEE Xplore