> But in two papers published in the 1990s, Wigderson and his collaborators proved that under certain assumptions, it’s always possible to convert a fast random

> But in two papers published in the 1990s, Wigderson and his collaborators proved that under certain assumptions, it’s always possible to convert a fast random algorithm into a fast deterministic algorithm. The result established that the complexity class known as “BPP” was exactly equal to the complexity class P. What about those assumptions, though? Was progress made on those? Otherwise it is still unknown whether BPP = P or not. For the interested, it seems that the two publications are [1] and [2]. [1] https://doi.org/10.1007%2Fbf01275486 https://doi.org/10.1007%2Fbf01275486 [2] https://doi.org/10.1145%2F258533.258590 https://doi.org/10.1145%2F258533.258590