Jim Kadin. The polynomial time hierarchy collapses if the Boolean hierarchy collapses. In Proceedings: Third Annual Structure in Complexity Theory Conference, Georgetown University, Washington, D. C., USA, June 14-17, 1988. pages 278-292, IEEE Computer Society, 1988. [doi]
@inproceedings{Kadin88-0,
title = {The polynomial time hierarchy collapses if the Boolean hierarchy collapses},
author = {Jim Kadin},
year = {1988},
doi = {10.1109/SCT.1988.5287},
url = {http://dx.doi.org/10.1109/SCT.1988.5287},
researchr = {https://researchr.org/publication/Kadin88-0},
cites = {0},
citedby = {0},
pages = {278-292},
booktitle = {Proceedings: Third Annual Structure in Complexity Theory Conference, Georgetown University, Washington, D. C., USA, June 14-17, 1988},
publisher = {IEEE Computer Society},
isbn = {0-8186-0794-7},
}