The polynomial time hierarchy collapses if the Boolean hierarchy collapses

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.