Barış Aydınlıoğlu
baris [at] cs [dot] wisc [dot] edu
|
|
|||||
Barış Aydınlıoğlu baris [at] cs [dot] wisc [dot] edu |
|||||
| About | |||||
| PhD student in the
Theoretical Computer Science group at the University of Wisconsin - Madison,
advised by Prof. Dieter van Melkebeek. |
|||||
| Interests | |||||
| Computational complexity theory. | |||||
| Papers | |||||
| • | 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, to appear. (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) | ||||