The University of Wisconsin-Madison
Computer Sciences Department

Barış Aydınlıoğlu

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


Interests

Computational complexity theory.

Publications
Affine Relativization: Unifying the Algebrization and Relativization Barriers
B. Aydınlıoğlu and E. Bach.
Electronic Colloquium on Computational Complexity, Technical Report ECCC-TR 16-040, 2017. (info) (pdf)

A Study of the NEXP vs. P/poly Problem and its Variants
B. Aydınlıoğlu.
PhD thesis, University of Wisconsin, Madison, 2017. (pdf)

Nondeterministic Circuit Lower Bounds from Mildly Derandomizing Arthur-Merlin Games
B. Aydınlıoğlu and D. van Melkebeek.
In Computational Complexity, 26: 79-118, 2017. (info) (pdf)
Electronic Colloquium on Computational Complexity, Technical Report ECCC-TR 10-174, 2012. (info) (pdf)
In Proceedings of the 27th IEEE Conference on Computational Complexity, pages 269-279, 2012. (info) (pdf)

Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds
B. Aydınlıoğlu, D. Gutfreund, J. M. Hitchcock and A. Kawachi.
In Computational Complexity, 20(2): 329-366, 2011. (info) (pdf)

A Note on Exponential Circuit Lower Bounds from Derandomizing Arthur-Merlin Games
S. Aaronson, B. Aydınlıoğlu, H. Buhrman, J. Hitchcock and D. van Melkebeek.
Electronic Colloquium on Computational Complexity, Technical Report ECCC-TR 10-174, 2010. (info) (pdf)