On Sets Truth-Table Reducible to Sparse Sets

We study sets that are truth-table reducible to sparse sets in polynomial time. The principal results are as follows: (1) For every integer $k > 0$, there is a set L and a sparse set S such that $L...

[1]  Eric Allender,et al.  P-Printable Sets , 1988, SIAM J. Comput..

[2]  José L. Balcázar,et al.  The polynomial-time hierarchy and sparse oracles , 1986, JACM.