A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
Electronic colloquium on computational complexity
The focus of this survey is the question of quantied derandomization, which was introduced by Goldreich and Wigderson (2014): Does derandomization of probabilistic algorithms become easier if we only want to derandomize algorithms that err with extremely small probability? How small does this probability need to be in order for the problem's complexity to be affected? This question opens the door to studying natural relaxed versions of the derandomization problem, and allows us to constructdblp:journals/eccc/Tell21 fatcat:dntqqo67ercrzjkog66xz4iyxu