Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > ADEWALE SEKONI:
All reports by Author Adewale Sekoni:

TR25-175 | 9th November 2025
John Hitchcock, Adewale Sekoni, Hadi Shafei

Random Permutations in Computational Complexity

Classical results of Bennett and Gill (1981) show that with probability 1, $P^A \neq NP^A$ relative to a random oracle $A$, and with probability 1, $P^\pi \neq NP^\pi \cap coNP^\pi$ relative to a random permutation $Pi$. Whether $P^A = NP^A \cap coNP^A$ holds relative to a random oracle $A$ remains ... more >>>




ISSN 1433-8092 | Imprint