Proving that prBPP=prP is as hard as "almost" proving that P \ne NP

Roei Tell. Proving that prBPP=prP is as hard as "almost" proving that P \ne NP. Electronic Colloquium on Computational Complexity (ECCC), 25:3, 2018. [doi]

Abstract

Abstract is missing.