Baris Aydinlioglu

Learn More
In several settings derandomization is known to follow from circuit lower bounds that themselves are equivalent to the existence of pseudorandom generators. This leaves open the question whether derandomization implies the circuit lower bounds that are known to imply it, i.e., whether the ability to derandomize in any way implies the ability to do so in the(More)
We present an alternate proof of the recent result by Gutfreund and Kawachi that derandom-izing Arthur-Merlin games into P NP implies linear-exponential circuit lower bounds for E NP. Our proof is simpler and yields stronger results. In particular, consider the promise-AM problem of distinguishing between the case where a given Boolean circuit C accepts at(More)
  • 1