Nondeterministic Circuit Lower Bounds from Mildly Derandomizing Arthur-Merlin Games

Baris Aydinlioglu, Dieter van Melkebeek. Nondeterministic Circuit Lower Bounds from Mildly Derandomizing Arthur-Merlin Games. Electronic Colloquium on Computational Complexity (ECCC), 19:80, 2012. [doi]

Authors

Baris Aydinlioglu

This author has not been identified. Look up 'Baris Aydinlioglu' in Google

Dieter van Melkebeek

This author has not been identified. Look up 'Dieter van Melkebeek' in Google