Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > IMMUNE SETS:
Reports tagged with immune sets:
TR26-318 | 4th October 2026
Gabriel Istrate

Separations with Immunity Relative to a Random Oracle in Computational Complexity

Rossman, Servedio, and Tan proved that the polynomial hierarchy is infinite relative to a random oracle. This paper strengthens this celebrated result by considering strong separations, witnessed by immune languages.

The main result of the paper shows that with respect to a random oracle the levels of the polynomial ... more >>>




ISSN 1433-8092 | Imprint