2013 IEEE 54th Annual Symposium on Foundations of Computer Science (1984)

Singer Island, FL

Oct. 24, 1984 to Oct. 26, 1984

ISBN: 0-8186-0591-X

pp: 308-311

J. Balcazar , Universitat Politecnica de Barcelona

ABSTRACT

We show that several questions about the polynomial-time hierarchy can be answered by answering their counterparts for the polynomial-time hierarchy relativized to an arbitrary sparse oracle set. For each of these questions, the answer will be the same for the hierarchy relativized to S/sub 1/ as it will be for the hierarchy relativized to S/sub 2/ for any choice of S/sub 1/ and S/sub 2/ that are sparse sets, including the choice of S/sub 1/ being empty and S/sub 2/ being nonempty but sparse.

INDEX TERMS

CITATION

A. Selman,
J. Balcazar,
U. Schoning,
T. Long,
R. Book,
"Sparse Oracles And Uniform Complexity Classes",

*2013 IEEE 54th Annual Symposium on Foundations of Computer Science*, vol. 00, no. , pp. 308-311, 1984, doi:10.1109/SFCS.1984.715929SEARCH