Re:How Randomness Improves Algorithms?
by jvanderbot on Saturday August 16, 2025 @01:45PM
(#44925471)
TFA (edit: in the politest way)
>> Well in fact we know (if P! = NP) that for any randomized ALG there's a good deterministic one
> Oh, that's cool, do you have a reference for that?
The OP article has such a reference, but theirs is paywalled, and perhaps you missed it, so you may wish to see this no paywall link to the paper:
Hardness vs. Randomness by Noam Nisan & Avi Wigderson https://www.math.ias.edu/~avi/PUBLICATIONS/MYPAPERS/NOAM/HAR...
Oh, that's cool, do you have a reference for that?