Strong separations of the polynomial hierarchy with oracles: constructive separations by immune and simple sets

Worlds to die for

ACM SIGACT News

Quantum and classical complexity classes: separations, collapses, and closure properties

Information and Computation

Resource bounded immunity and simplicity

Theoretical Computer Science

Quantum and classical complexity classes: Separations, collapses, and closure properties

Information and Computation

Collapsing recursive oracles for relativized polynomial hierarchies

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory