Baris Aydinlioglu

Learn 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