#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2008

2016

- This year (0)
- Last 5 years (2)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Baris Aydinlioglu, Dieter van Melkebeek
- computational complexity
- 2012

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… (More)

- Scott Aaronson, Baris Aydinlioglu, Harry Buhrman, John M. Hitchcock, Dieter van Melkebeek
- Electronic Colloquium on Computational Complexity
- 2010

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)

This is a technical lecture throughout which we prove the hypercontractivity of the noise operator , a result that will be used in later lectures. The reader may wish to review the notes of lecture 6 for a discussion of the noise operator T α , the p-norm of a function from the Boolean cube to the reals, and the notion of hypercontractivity. (T α f)(x) = E… (More)

- Baris Aydinlioglu, Eric Bach
- Electronic Colloquium on Computational Complexity
- 2016

We strengthen existing evidence for the so-called “algebrization barrier”. Algebrization — short for algebraic relativization — was introduced by Aaronson and Wigderson (AW) (STOC 2008) in order to characterize proofs involving arithmetization, simulation, and other “current techniques”. However, unlike relativization, eligible statements under this notion… (More)

- ‹
- 1
- ›