The University of Wisconsin-Madison
Computer Sciences Department

Barış Aydınlıoğlu

baris [at] cs [dot] wisc [dot] edu


About
PhD student in the Theory of Computing group, advised by Eric Bach.

Interests
Computational complexity theory.

Papers
B. Aydınlıoğlu and E. Bach. Affine Relativization: Unifying the Algebrization and Relativization Barriers . Electronic Colloquium on Computational Complexity, Technical Report ECCC-TR 16-040, 2016. (PDF)
B. Aydınlıoğlu and D. van Melkebeek. Nondeterministic Circuit Lower Bounds from Mildly Derandomizing Arthur-Merlin Games . In Proceedings of the 27th IEEE Conference on Computational Complexity, pages 269-279, 2012. (PDF)
B. Aydınlıoğlu, D. Gutfreund, J. M. Hitchcock and A. Kawachi. Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds . Computational Complexity, 20(2): 329-366, 2011. (PDF)
S. Aaronson, B. Aydınlıoğlu, H. Buhrman, J. Hitchcock and D. van Melkebeek. A Note on Exponential Circuit Lower Bounds from Derandomizing Arthur-Merlin Games , Electronic Colloquium on Computational Complexity, Technical Report ECCC-TR 10-174, 2010. (PDF)