A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
We investigate whether circuit lower bounds for monotone circuits can be used to derandomize randomized monotone circuits. We show that, in fact, any derandomization of randomized monotone computations would derandomize all randomized computations, whether monotone or not. We prove similar results in the settings of pseudorandom generators and average-case hard functions -that a pseudorandom generator secure against monotone circuits is also secure with somewhat weaker parameters againstdoi:10.1016/j.tcs.2012.02.017 fatcat:6mk5ovihtzaxvhrexnd2vt5tci