Baris Aydinlioglu

According to our database, Baris Aydinlioglu authored at least 6 papers between 2010 and 2019.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2019

Corrigendum to Affine Relativization: Unifying the Algebrization and Relativization Barriers.

Baris Aydinlioglu, Eric Bach

ACM Trans. Comput. Theory, 2019

2017

Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games.

Baris Aydinlioglu, Dieter van Melkebeek

Comput. Complex., 2017

2016

Affine Relativization: Unifying the Algebrization and Relativization Barriers.

Baris Aydinlioglu, Eric Bach

Electron. Colloquium Comput. Complex., 2016

2012

Nondeterministic Circuit Lower Bounds from Mildly De-randomizing Arthur-Merlin Games.

Baris Aydinlioglu, Dieter van Melkebeek

Proceedings of the 27th Conference on Computational Complexity, 2012

2011

Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds.

Baris Aydinlioglu, Dan Gutfreund, John M. Hitchcock, Akinori Kawachi

Comput. Complex., 2011

2010

A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games.

Scott Aaronson, Baris Aydinlioglu, Harry Buhrman, John M. Hitchcock, Dieter van Melkebeek

Electron. Colloquium Comput. Complex., 2010